{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:42:19Z","timestamp":1725536539580},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033551"},{"type":"electronic","value":"9783642033568"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03356-8_25","type":"book-chapter","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T14:00:39Z","timestamp":1250604039000},"page":"428-444","source":"Crossref","is-referenced-by-count":12,"title":["Practical Cryptanalysis of iso\/iec 9796-2 and emv Signatures"],"prefix":"10.1007","author":[{"given":"Jean-S\u00e9bastien","family":"Coron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf-Philipp","family":"Weinmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"216","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1090\/S0025-5718-96-00775-2","volume":"65","author":"E. Bach","year":"1996","unstructured":"Bach, E., Peralta, R.: Asymptotic semismoothness probabilities. Mathematics of Computation\u00a065(216), 1701\u20131715 (1996)","journal-title":"Mathematics of Computation"},{"key":"25_CR2","first-page":"62","volume-title":"Proceedings of CCS 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of CCS 1993, pp. 62\u201373. ACM, New York (1993)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption: How to encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact security of digital signatures: How to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"25_CR5","unstructured":"Bernstein, D.J.: Fast Multiplications and its applications. Algorithmic Number Theory\u00a044 (2008)"},{"key":"25_CR6","unstructured":"Bernstein, D.J.: How to find smooth parts of integers (2004\/05\/10), http:\/\/cr.yp.to\/papers.html#smoothparts"},{"key":"25_CR7","unstructured":"Bernstein, D.J.: Scaled remainder trees (2004\/08\/20), http:\/\/cr.yp.to\/papers.html#scaledmod"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055716","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"D. Bleichenbacher","year":"1998","unstructured":"Bleichenbacher, D.: Chosen ciphertext attacks against protocols based on the RSA encryption standard. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 1\u201312. Springer, Heidelberg (1998)"},{"issue":"205","key":"25_CR9","first-page":"333","volume":"62","author":"D. Coppersmith","year":"1994","unstructured":"Coppersmith, D.: Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Mathematics of Computation\u00a062(205), 333\u2013350 (1994)","journal-title":"Mathematics of Computation"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-007-9007-5","volume":"21","author":"D. Coppersmith","year":"2008","unstructured":"Coppersmith, D., Coron, J.-S., Grieu, F., Halevi, S., Jutla, C.S., Naccache, D., Stern, J.P.: Cryptanalysis of iso\/iec 9796-1. Journal of Cryptology\u00a021, 27\u201351 (2008)","journal-title":"Journal of Cryptology"},{"key":"25_CR11","unstructured":"Coppersmith, D., Halevi, S., Jutla, C.: iso 9796-1 and the new, forgery strategy, Research contribution to P.1363 (1999), grouper.ieee.org\/groups\/1363\/Research"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Coron, J.S., Naccache, D., Tibouchi, M., Weinmann, R.P.: Practical Cryptanalysis of ISO \/ IEC 9796-2 and EMV Signatures, Cryptology ePrint Archive, Report 2009\/203, http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-03356-8_25"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-45708-9_39","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.-S. Coron","year":"2002","unstructured":"Coron, J.-S.: Security proofs for partial domain hash signature schemes. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 613\u2013626. Springer, Heidelberg (2002)"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10623-004-5660-y","volume":"38","author":"J.-S. Coron","year":"2006","unstructured":"Coron, J.-S., Desmedt, Y., Naccache, D., Odlyzko, A., Stern, J.P.: Index calculation attacks on RSA signature and encryption. Index calculation attacks on RSA signature and encryption Designs, Codes and Cryptography\u00a038(1), 41\u201353 (2006)","journal-title":"Index calculation attacks on RSA signature and encryption Designs, Codes and Cryptography"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45539-6_25","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S., Naccache, D., Joye, M., Paillier, P.: New attacks on pkcs#1 v1.5 encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 369\u2013381. Springer, Heidelberg (2000)"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48405-1_1","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"J.-S. Coron","year":"1999","unstructured":"Coron, J.-S., Naccache, D., Stern, J.P.: On the security of RSA padding. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 1\u201318. Springer, Heidelberg (1999)"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/3-540-39799-X_40","volume-title":"Advances in Cryptology","author":"Y. Desmedt","year":"1986","unstructured":"Desmedt, Y., Odlyzko, A.: A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 516\u2013522. Springer, Heidelberg (1986)"},{"key":"25_CR18","unstructured":"EMV, Integrated circuit card specifications for payment systems, Book 2. Security and Key Management. Version 4.2 (June 2008), http:\/\/www.emvco.com"},{"key":"25_CR19","first-page":"167","volume-title":"Proceedings of issac 2007, Waterloo, Ontario, Canada","author":"P. Gaudry","year":"2007","unstructured":"Gaudry, P., Kruppa, A., Zimmermann, P.: A gmp-based implementation of Sch\u0151nhage-Strassen\u2019s large integer multiplication algorithm. In: Proceedings of issac 2007, Waterloo, Ontario, Canada, pp. 167\u2013174. ACM Press, New York (2007)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-45539-6_5","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Grieu","year":"2000","unstructured":"Grieu, F.: A chosen messages attack on the iso\/iec 9796-1 signature scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 70\u201380. Springer, Heidelberg (2000)"},{"key":"25_CR21","unstructured":"Hart, W.B., et al.: Multiple Precision Integers and Rationals, http:\/\/www.mpir.org"},{"key":"25_CR22","unstructured":"ISO \/ IEC 9796, Information technology \u2013 Security techniques \u2013 Digital signature scheme giving message recovery, Part 1: Mechanisms using redundancy (1999)"},{"key":"25_CR23","unstructured":"ISO \/ IEC 9796-2, Information technology \u2013 Security techniques \u2013 Digital signature scheme giving message recovery, Part 2: Mechanisms using a hash-function (1997)"},{"key":"25_CR24","unstructured":"ISO \/ IEC 9796-2:2002, Information technology \u2013 Security techniques \u2013 Digital signature schemes giving message recovery \u2013 Part 2: Integer factorization based mechanisms (2002)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-76900-2_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"A. Joux","year":"2007","unstructured":"Joux, A., Naccache, D., Thom\u00e9, E.: When e-th roots become easier than factoring. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 13\u201328. Springer, Heidelberg (2007)"},{"key":"25_CR26","unstructured":"Kaliski, B.: pkcs#1: RSA Encryption Standard, Version 1.5, RSA Laboratories (November 1993)"},{"key":"25_CR27","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/PL00008266","volume":"24","author":"E. Kaltofen","year":"1999","unstructured":"Kaltofen, E., Lobo, A.: Distributed matrix-free solution of large sparse linear systems over finite fields. Algorithmica\u00a024, 331\u2013348 (1999)","journal-title":"Algorithmica"},{"key":"25_CR28","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"issue":"2","key":"25_CR29","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126(2), 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"25_CR30","unstructured":"Lobo, A.: wlss2: an implementation of the homogeneous block Wiedemann algorithm, www4.ncsu.edu\/~kaltofen\/software\/wiliss"},{"key":"25_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BFb0054011","volume-title":"Public Key Cryptography","author":"J.-F. Misarsky","year":"1998","unstructured":"Misarsky, J.-F.: How (not) to design RSA signature schemes. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 14\u201328. Springer, Heidelberg (1998)"},{"key":"25_CR32","unstructured":"Paar, C., Schimmer, M.: copacobana: A Codebreaker for des and other ciphers, www.copacobana.org"},{"key":"25_CR33","unstructured":"The PARI Group, PARI\/GP, version 2.3.4, Bordeaux (2008), http:\/\/pari.math.u-bordeaux.fr"},{"key":"25_CR34","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the acm\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the acm"},{"key":"25_CR35","unstructured":"The sage development team, sage mathematics software, Version 3.3 (2009), http:\/\/www.sagemath.org"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03356-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:10:15Z","timestamp":1558491015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03356-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033551","9783642033568"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03356-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}