{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:00Z","timestamp":1725493620349},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430261"},{"type":"electronic","value":"9783540453253"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45325-3_10","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T07:51:25Z","timestamp":1193471485000},"page":"99-113","source":"Crossref","is-referenced-by-count":1,"title":["On Rabin-Type Signatures"],"prefix":"10.1007","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","published-online":{"date-parts":[[2001,12,4]]},"reference":[{"unstructured":"FIPS 180-1. Secure Hash Standard. Federal Information Processing Standards Publication 180-1, U.S. Department of Commerce, April 1995.","key":"10_CR1"},{"unstructured":"IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29, 2000.","key":"10_CR2"},{"unstructured":"ISO\/IEC 9796. Information technology-Security techniques-Digital signature scheme giving message recovery, 1991.","key":"10_CR3"},{"doi-asserted-by":"crossref","unstructured":"Henri Cohen. A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics. Springer-Verlag, 1993.","key":"10_CR4","DOI":"10.1007\/978-3-662-02945-9"},{"key":"10_CR5","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201999","author":"J.-S. Coron","year":"1999","unstructured":"Jean-S\u00e9bastien Coron, David Naccache, and Julien P. Stern. On RSA padding. In M. Wiener, editor, Advances in Cryptology \u2014 CRYPTO\u201999, volume 1666 of Lecture Notes in Computer Science, pages 1\u201318. Springer-Verlag, 1999."},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-39799-X_3","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201985","author":"W. Jonge de","year":"1986","unstructured":"Wiebren de Jonge and David Chaum. Attacks on some RSA signatures. In H. C. Williams, editor, Advances in Cryptology \u2014 CRYPTO\u201985, volume 218 of Lecture Notes in Computer Science, pages 18\u201327, 1986."},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","first-page":"110","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201988","author":"M. Girault","year":"1990","unstructured":"Marc Girault, Philippe Toffin, and Brigitte Vall\u00e9e. Computation of approximate L-th root modulo n and application to cryptography. In S. Goldwasser, editor, Advances in Cryptology \u2014 CRYPTO\u201988, volume 403 of Lecture Notes in Computer Science, pages 110\u2013117, 1990."},{"unstructured":"Burton S. Kaliski Jr. A layman\u2019s guide to a subset of ASN.1, BER, and DER. RSA Laboratories Technical Note, RSA Laboratories, November 1993. Available at \n                  http:\/\/www.rsasecurity.com\/rsalabs\/pkcs\/\n                  \n                .","key":"10_CR8"},{"unstructured":"Donald E. Knuth. The Art of Computer Programming, v. 2. Seminumerical Algorithms. Addison-Wesley, 2nd edition, 1981.","key":"10_CR9"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/0161-118891862972","volume":"12","author":"K. Kurosawa","year":"1988","unstructured":"Kaoru Kurosawa, Toshiya Itoh, and Masashi Takeuchi. Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number. Cryptologia, 12(4):225\u2013233, 1988.","journal-title":"Cryptologia"},{"key":"10_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49649-1_1","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201998","author":"A. K. Lenstra","year":"1998","unstructured":"Arjen K. Lenstra. Generating RSA moduli with a predetermined portion. In K. Ohta and D. Pei, editors, Advances in Cryptology \u2014 ASIACRYPT\u201998, volume 1514 of Lecture Notes in Computer Science, pages 1\u201310. Springer-Verlag, 1998."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"785","DOI":"10.2307\/2153299","volume":"63","author":"A. K. Lenstra","year":"1994","unstructured":"Arjen K. Lenstra and Mark S. Manasse. Factoring with two large primes. Mathematics of Computation, 63:785\u2013798, 1994.","journal-title":"Mathematics of Computation"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00193566","volume":"5","author":"J. H. Loxton","year":"1992","unstructured":"J. H. Loxton, David S. Khoo, Gregory J. Bird, and Jennifer Seberry. A cubic RSA code equivalent to factorization. Journal of Cryptology, 5(2):139\u2013150, 1992.","journal-title":"Journal of Cryptology"},{"unstructured":"Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.","key":"10_CR14"},{"key":"10_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-49264-X_9","volume-title":"Advances in Cryptology \u2014EUROCRYPT\u201995","author":"P. L. Montgomery","year":"1995","unstructured":"Peter L. Montgomery. A block Lanczos algorithm for finding dependencies over GF(2). In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology \u2014EUROCRYPT\u201995, volume 921 of Lecture Notes in Computer Science, pages 106\u2013120, 1995."},{"unstructured":"Michael O. Rabin. Digitized signatures and public-key functions as intractable as factorization. Technical Report LCS\/TR-212, M.I.T. Lab. for Computer Science, January 1979.","key":"10_CR16"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s001459900038","volume":"11","author":"R. Scheidler","year":"1998","unstructured":"Renate Scheidler. A public-key cryptosystem using purely cubic fields. Journal of Cryptology, 11(2):109\u2013124, 1998.","journal-title":"Journal of Cryptology"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01398010","volume":"6","author":"R. Scheidler","year":"1995","unstructured":"Renate Scheidler and Hugh C. Williams. A public-key cryptosystem utilizing cyclotomic fields. Designs, Codes and Cryptography, 6:117\u2013131, 1995.","journal-title":"Designs, Codes and Cryptography"},{"unstructured":"Joseph H. Silverman. A Friendly Introduction to Number Theory. Prentice-Hall, 1997.","key":"10_CR19"},{"unstructured":"Robert D. Silverman and David Naccache. Recent results on signature forgery, April 1999. Available at \n                  http:\/\/www.rsasecurity.com\/rsalabs\/bulletins\/sigforge.html\n                  \n                .","key":"10_CR20"},{"issue":"6","key":"10_CR21","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TIT.1980.1056264","volume":"IT-26","author":"H. C. Williams","year":"1980","unstructured":"Hugh C. Williams. A modification of the RSA public-key encryption procedure. IEEE Transactions on Information Theory, IT-26(6):726\u2013729, 1980.","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-39568-7_7","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO \u201984","author":"H. C. Williams","year":"1986","unstructured":"____ Some public-key crypto-functions as intractable as factorization. In G. R. Blakley and D. Chaum, editors, Advances in Cryptology \u2014 Proceedings of CRYPTO \u201984, volume 196 of Lecture Notes in Computer Science, pages 66\u201370. Springer-Verlag, 1986."},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1080\/0161-118591859942","volume":"9","author":"H. C. Williams","year":"1985","unstructured":"____ Some public-key crypto-functions as intractable as factorization. Cryptologia, 9(3):223\u2013237, 1985. An extended abstract appears in [25].","journal-title":"Cryptologia"},{"key":"10_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-39799-X_26","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201985","author":"H. C. Williams","year":"1986","unstructured":"____ An M\n                        3 public key encryption scheme. In H. C. Williams, editor, Advances in Cryptology \u2014 CRYPTO\u201985, volume 218 of Lecture Notes in Computer Science, pages 358\u2013368. Springer-Verlag, 1986."}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45325-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T11:49:28Z","timestamp":1539344968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45325-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430261","9783540453253"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45325-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}