{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:00Z","timestamp":1725664740165},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624943"},{"type":"electronic","value":"9783540680475"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62494-5_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:37:37Z","timestamp":1330295857000},"page":"111-116","source":"Crossref","is-referenced-by-count":0,"title":["A comparison of RSA and the Naccache-Stern public-key cryptosystem"],"prefix":"10.1007","author":[{"given":"Thomas W.","family":"Cusick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0898-1221(79)90039-7","volume":"5","author":"G. R. Blakley","year":"1979","unstructured":"G. R. Blakley and I. Borosh, Rivest-Shamir-Adleman public-key cryptosystems do not always conceal messages, Comput. Math. with Applic. 5 (1979), 169\u2013178.","journal-title":"Comput. Math. with Applic."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-39799-X_40","volume":"218","author":"Y. Desmedt","year":"1986","unstructured":"Y. Desmedt and A. M. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithm problems, Advances in Cryptology-CRYPTO'85 Proceedings (Springer Lecture Notes in Computer Science 218, 1986), 516\u2013522.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. C. Pohlig","year":"1978","unstructured":"S. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms in GF(p) and its cryptographic significance, IEEE Trans. Info. Theory 24 (1978), 106\u2013111.","journal-title":"IEEE Trans. Info. Theory"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1112\/S0025579300009591","volume":"26","author":"D. R. Smith","year":"1979","unstructured":"D. R. Smith and J. T. Palmer, Universal fixed messages and the Rivest-Shamir-Adleman cryptosystem, Mathematika 26 (1979), 44\u201352.","journal-title":"Mathematika"},{"key":"10_CR5","unstructured":"D. Naccache and J. Stern, A new public-key encryption scheme, presentation at Luminy, September 1995."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(87)90081-8","volume":"52","author":"J. Gathen von zur","year":"1987","unstructured":"J. von zur Gathen, Factoring polynomials and primitive elements for special primes, Theoret. Comput. Sci. 52 (1987), 77\u201389.","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR7","unstructured":"D. Weber, Discrete logarithms mod p, e-mail announcement, October 1995."}],"container-title":["Lecture Notes in Computer Science","Security Protocols"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62494-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:38:16Z","timestamp":1619573896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62494-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624943","9783540680475"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-62494-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}