{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:31Z","timestamp":1725564391908},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205920"},{"type":"electronic","value":"9783540400615"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40061-5_31","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T19:06:00Z","timestamp":1283713560000},"page":"492-506","source":"Crossref","is-referenced-by-count":1,"title":["The Insecurity of Esign in Practical Implementations"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Howgrave-Graham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwena\u00eblle","family":"Martinet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Poupard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/380752.380857","volume-title":"Proceedings of the 33rd Annual Symposium on the Theory of Computing (STOC) 2001","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd Annual Symposium on the Theory of Computing (STOC) 2001, pp. 601\u2013610. ACM Press, New York (2001)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BFb0052242","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Goldwasser, S., Miccianco, D.: \u201cPseudo-Random\u201d Number Generation within Cryptographic Algorithms: the DSS Case. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 277\u2013291. Springer, Heidelberg (1997)"},{"key":"31_CR3","unstructured":"Bleichenbacher, D.: On the Generation of DSA One-Time Keys. In: The 6th Workshop on Elliptic Curve Cryptography, ECC 2002 (2002)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-44647-8_17","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D.: Simplified OAEP for the RSA and Rabin Functions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 275\u2013291. Springer, Heidelberg (2001)"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring n = prq for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 326\u2013337. Springer, Heidelberg (1999)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: An attack on RSA given a fraction on the private key bits. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 25\u201334. Springer, Heidelberg (1998)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-39799-X_4","volume-title":"Advances in Cryptology","author":"E.F. Brickell","year":"1986","unstructured":"Brickell, E.F., DeLaurentis, J.M.: An attack on a signature scheme proposed by Okamoto and Shiraishi. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 28\u201332. Springer, Heidelberg (1986)"},{"key":"31_CR9","first-page":"501","volume-title":"Contemporary Cryptology \u2013 The Science of Information Integrity","author":"E.F. Brickell","year":"1991","unstructured":"Brickell, E.F., Odlyzko, A.M.: Cryptanalysis: A Survey of Recent Results. In: Simmons, G.J. (ed.) Contemporary Cryptology \u2013 The Science of Information Integrity, pp. 501\u2013540. IEEE Press, Los Alamitos (1991)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-45238-6_21","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"P.A. Fouque","year":"2003","unstructured":"Fouque, P.A., Martinet, G., Poupard, G.: Attacking Unbalanced RSA-CRT using SPA. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 254\u2013268. Springer, Heidelberg (2003)"},{"key":"31_CR11","unstructured":"Fujisaki, E., Kobayashi, T., Morita, H., Oguro, H., Okamoto, T., Okasaki, S.: ESIGN: Efficient Digital Signature Scheme (2000) (submission to NESSIE)"},{"key":"31_CR12","volume-title":"Modern Computer Algebra","author":"J. Gathen van zur","year":"1999","unstructured":"van zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/0-387-34799-2_9","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"M. Girault","year":"1990","unstructured":"Girault, M., Toffin, P., Vall\u00e9e, B.: Computation of Approximate l-th Roots Modulo n and Application to Cryptography. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 100\u2013117. Springer, Heidelberg (1990)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-36413-7_17","volume-title":"Security in Communication Networks","author":"L. Granboulan","year":"2003","unstructured":"Granboulan, L.: How to repair Esign. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 234\u2013240. Springer, Heidelberg (2003)"},{"key":"31_CR15","unstructured":"Howgrave-Graham, N.: A Review of the ESIGN digital signature standard (2001), Available at: \n                    \n                      http:\/\/www.shiba.tao.go.jp\/kenkyu\/CRYPTREC\/fy15\/cryptrec20030424outrp.html\n                    \n                    \n                   Report#1007"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N. Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N., Smart, N.P.: Lattice Attacks on Digital Signature Schemes. Design, Codes and Cryptography\u00a023, 283\u2013290 (2001)","journal-title":"Design, Codes and Cryptography"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1146\/annurev.cs.02.060187.001311","volume":"2","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Algorithmic geometry of numbers. Annual Review of Computer Science\u00a02, 231\u2013267 (1987)","journal-title":"Annual Review of Computer Science"},{"issue":"4","key":"31_CR18","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"K. Lenstra","year":"1982","unstructured":"Lenstra, K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring Polynomials with Rational Coeficients. Mathematische Annalen\u00a0261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"issue":"3","key":"31_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. Journal of Cryptology\u00a015(3), 151\u2013176 (2002)","journal-title":"Journal of Cryptology"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguy\u00ean","year":"2001","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The Two Faces of Lattices in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"31_CR21","unstructured":"NIST. Digital Signature Standard (DSS). Federal Information Processing Standards PUBlication 186 (November 1994)"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-45664-3_18","volume-title":"Public Key Cryptography","author":"R. Novak","year":"2002","unstructured":"Novak, R.: SPA-Based Adaptive Chosen-Ciphertext Attack on RSA Implementation. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 252\u2013261. Springer, Heidelberg (2002)"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Shiraishi, A.: A Digital Signature Scheme Based on Quadratic Inequalities. In: Proceedings of Symposium on Security and Privacy, pp. 123\u2013132 (1985)","DOI":"10.1109\/SP.1985.10026"},{"key":"31_CR24","unstructured":"Shoup, V.: Number Theory C++ Library (NTL), version 5.0b, Available at: \n                    \n                      http:\/\/www.shoup.net"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45708-9_7","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Stern","year":"2002","unstructured":"Stern, J., Pointcheval, D., Malone Lee, J., Smart, P.: Flaws in Applying Proof Methodologies to Signatures Schemes. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 93\u2013110. Springer, Heidelberg (2002)"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-45961-8_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"B. Vall\u00e9e","year":"1988","unstructured":"Vall\u00e9e, B., Girault, M., Toffin, P.: How to Break Okamoto\u2019s Cryptosystem by Reducing Lattices Bases. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 281\u2013291. Springer, Heidelberg (1988)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2003"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40061-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:43:05Z","timestamp":1558287785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40061-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205920","9783540400615"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40061-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}