{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:05:53Z","timestamp":1754161553757,"version":"3.41.2"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1023\/a:1008256404676","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"53-56","source":"Crossref","is-referenced-by-count":0,"title":["Reducing the Elliptic Curve Cryptosystem of Meyer-M\u00fcller to the Cryptosystem of Rabin-Williams"],"prefix":"10.1007","volume":"14","author":[{"given":"Marc","family":"Joye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"153101_CR1","unstructured":"D. Bleichenbacher. Personal communication."},{"key":"153101_CR2","doi-asserted-by":"crossref","unstructured":"D. Coppersmith. Finding a small root of a univariate modular equation. In U. Maurer, editor, Advances of Cryptology - Eurocrypt'96, volume 1070 of Lectures Notes in Computer Science, Springer-Verlag (1996) pp. 155-165.","DOI":"10.1007\/3-540-68339-9_14"},{"key":"153101_CR3","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter. Low-exponent RSA with related messages. In U. Maurer, editor, Advances of Cryptology - Eurocrypt'96, volume 1070 of Lectures Notes in Computer Science, Springer-Verlag (1996) pp. 1-9.","DOI":"10.1007\/3-540-68339-9_1"},{"key":"153101_CR4","unstructured":"M. Joye and J.-J. Quisquater. On the cryptosystem of Chua and Ling. Technical Report CG-1997\/4, UCL Crypto Group, April (1997)."},{"key":"153101_CR5","doi-asserted-by":"crossref","unstructured":"K. Koyama, U. Maurer, T. Okamoto, and S. Vanstone. New public-key schemes based on elliptic curves over the ring Z\nn. In J. Feigenbaum, editor, Advances of Cryptology - Crypto'91, volume 576 of Lectures Notes in Computer Science, Springer-Verlag (1991) pp. 252-256.","DOI":"10.1007\/3-540-46766-1_20"},{"key":"153101_CR6","unstructured":"H. Kuwakado and K. Koyama. A uniquely decipherable Rabin-type scheme over elliptic curves. Technical Report ISEC95-33 (in Japanese), IEICE, December (1995)."},{"key":"153101_CR7","doi-asserted-by":"crossref","unstructured":"B. Meyer and V. M\u00fcller. A public key cryptosystem based on elliptic curves over Z\n\/n\nZequivalent to factoring. In U. Maurer, editor, Advances of Cryptology - Eurocrypt'96, volume 1070 of Lectures Notes in Computer Science, Springer-Verlag (1996) pp. 49-59.","DOI":"10.1007\/3-540-68339-9_5"},{"key":"153101_CR8","unstructured":"J. Patarin. Some serious protocol failures for RSA with exponent eof less than \u2243 32 bits. In Proceedings of the Conference of Cryptography, Luminy, France, September (1995)."},{"key":"153101_CR9","unstructured":"M. O. Rabin. Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT\/LCS\/TR-212, MIT, Laboratory for Computer Science, January (1979)."},{"issue":"2","key":"153101_CR10","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, Vol. 21, No.2 (1978) pp. 120-126.","journal-title":"Communications of the ACM"},{"issue":"6","key":"153101_CR11","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"26","author":"H. C. Williams","year":"1980","unstructured":"H. C. Williams. A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory, IT Vol. 26, No.6 November (1980) pp. 726-729.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008256404676.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008256404676\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008256404676.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T02:32:32Z","timestamp":1753756352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008256404676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["153101"],"URL":"https:\/\/doi.org\/10.1023\/a:1008256404676","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}