{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T02:50:12Z","timestamp":1652496612463},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540646938","type":"print"},{"value":"9783540691051","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054011","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T03:42:35Z","timestamp":1149651755000},"page":"14-28","source":"Crossref","is-referenced-by-count":16,"title":["How (not) to design RSA signature schemes"],"prefix":"10.1007","author":[{"given":"Jean -Fran\u00c7ois","family":"Misarsky","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"E. Brickell and J. DeLaurentis, An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi, Proc. of Crypto '85, Lecture Notes in Computer Science, vol. 218, Springer-Verlag, pp. 28.32.","DOI":"10.1007\/3-540-39799-X_4"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, P. Rogaway, The Exact Security of Digital Signatures \u2014 How to Sign with RSA and Rabin, Advances in Cryptology, Eurocrypt '96, LNCS 1070, 1996.","DOI":"10.1007\/3-540-68339-9_34"},{"key":"2_CR3","volume-title":"Analysis of ISO\/CCITT Document X.509 Annex D","author":"D. Coppersmith","year":"1989","unstructured":"D. Coppersmith, Analysis of ISO\/CCITT Document X.509 Annex D, memorandum, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 10598, U.S.A., 11th June 1989."},{"key":"2_CR4","volume-title":"Technical Report TR-CS-82-2","author":"G. Davida","year":"1982","unstructured":"G. Davida, Chosen Signature Cryptanalysis of the RSA (MIT) Public Key Cryptosystem, Technical Report TR-CS-82-2, Department of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, USA, October 1982."},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/358027.358052","volume":"27","author":"D.E. Denning","year":"1984","unstructured":"D.E. Denning, Digital Signatures with RSA and other Public-key cryptosystems, Communications of the ACM 27, 4, April 1984, 388\u2013392.","journal-title":"Communications of the ACM"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M. Hellman, New Directions in Cryptography, IEEE Trans. Inform. Theory IT-22, Nov. 1976, 644\u2013654.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR7","first-page":"18","volume-title":"Lectures Notes In Computer Science, Vol. 218","author":"W. Jonge de","year":"1986","unstructured":"W. de Jonge, D. Chaum, Attacks on Some RSA Signatures, Advances in Cryptology, Crypto '85 proceedings, Lectures Notes In Computer Science, Vol. 218, Springer-Verlag, Berlin, 1986, pp. 18\u201327."},{"key":"2_CR8","first-page":"516","volume-title":"Lectures Notes In Computer Science, Vol. 218","author":"Y. Desmedt","year":"1986","unstructured":"Y. Desmedt, A.M. Odlyzko, A Chosen Text Attack on RSA Cryptosystem and some Discrete Logarithm Schemes, Advances in Cryptology, Crypto '85 proceedings, Lectures Notes In Computer Science, Vol. 218, Springer-Verlag, Berlin, 1986, pp. 516\u2013522."},{"key":"2_CR9","unstructured":"M. Girault, How to Forge RSA Key Certificates (even when adding redundancy), unpublished, personal communication."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"J. A. Gordon, How to Forge RSA Key Certificates, Electronics Letters, 25th April 1985, Vol. 21 N. 9.","DOI":"10.1049\/el:19850269"},{"key":"2_CR11","unstructured":"M. Girault, J.F. Misarsky, Selective Forgery of RSA Signatures Using Redundancy, Advances in Cryptology \u2014 Eurocrypt '97, Lecture Notes in Computer Science, vol. 1233, Springer-Verlag, pp 495\u2013507."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"L.C. Guillou, J.J. Quisquater, M. Walker, P. Landrock, C. Shaer, Precautions taken against various potential attacks in ISO\/IEC DIS 9796, Digital signature scheme giving message recovery, Eurocrypt '90 Proceedings, Lecture Notes in Computer Science, vol. 473, Springer-Verlag, pp 465\u2013473.","DOI":"10.1007\/3-540-46877-3_42"},{"key":"2_CR13","unstructured":"ISO\/IEC 9796, Digital Signature Scheme Giving Message Recovery, December 1991."},{"key":"2_CR14","unstructured":"ISO\/IEC JTC 1\/SC 27, Digital Signature Schemes Giving Message Recovery; Part 2: Mechanisms using a hash function, Working Draft, January 1996."},{"key":"2_CR15","unstructured":"ISO\/IEC 9796-3, Digital Signature Schemes Giving Message Recovery; Part 3: Mechanisms using a check-function, Working Draft, December 1996."},{"issue":"n.4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra, L. Lov\u00e1sz, Factoring Polynomials with Rational Coefficients, Mathematische Annalen, vol. 261, n. 4, 1982, pp. 515\u2013534.","journal-title":"Mathematische Annalen"},{"key":"2_CR17","unstructured":"J. F. Misarsky, A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy, Advances in Cryptology \u2014 Crypto '97, Lecture Notes in Computer Science, vol. 1294, Springer-Verlag, pp. 221\u2013234."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"T. Okamoto, A. Shiraishi, A Fast Signature Scheme Based on Quadratic Inequalities, Proc. of the 1985 Symposium on Security and Privacy, April 1985, Oakland, CA.","DOI":"10.1109\/SP.1985.10026"},{"key":"2_CR19","unstructured":"RSA Laboratories, PKCS #1: RSA Encryption Standard, Version 1.5, November 1993."},{"key":"2_CR20","volume-title":"Technical Memo LCS!TM82","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, MIT Laboratory for Computer Science, Technical Memo LCS!TM82, Cambridge, Massachusetts, 4\/4\/77. Also Comm. ACM, Vol. 21, N. 2, Feb 1978."}],"container-title":["Public Key Cryptography","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:46:35Z","timestamp":1555641995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646938","9783540691051"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0054011","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1998]]}}}