{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:01:24Z","timestamp":1725494484219},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76900-2_2","type":"book-chapter","created":{"date-parts":[[2007,11,4]],"date-time":"2007-11-04T20:38:44Z","timestamp":1194208724000},"page":"13-28","source":"Crossref","is-referenced-by-count":11,"title":["When e-th Roots Become Easier Than Factoring"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Joux","sequence":"first","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Thom\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Aoki, K., Franke, J., Kleinjung, T., Lenstra, A., Osvik, D.: Electronic newsgroup posting announcing the factorization of the 1039-th Mersenne number by the snfs (May 21, 2007), http:\/\/www.loria.fr\/zimmerma\/records\/21039-"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00145-002-0120-1","volume":"16","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Namprempre, C., Pointcheval, D., Semanko, M.: The One-More-RSA-Inversion Problems and the Security of Chaum\u2019s Blind Signature Scheme. Journal of Cryptology\u00a016(3), 185\u2013215 (2003)","journal-title":"Journal of Cryptology"},{"key":"2_CR3","series-title":"LMN","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0091539","volume-title":"The development of the number field sieve","author":"J.P. Buhler","year":"1993","unstructured":"Buhler, J.P., Lenstra, A.K., Pollard, J.M.: Factoring integers with the number field sieve. In: Lenstra, A.K., Lenstra Jr., H.W. (eds.) The development of the number field sieve. LMN, vol.\u00a01554, pp. 50\u201394. Springer, Heidelberg (1993)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-44647-8_25","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"\u00c9. Brier","year":"2001","unstructured":"Brier, \u00c9., Clavier, C., Coron, J.-S., Naccache, D.: Cryptanalysis of RSA signatures with fixed-pattern padding. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 433\u2013439. Springer, Heidelberg (2001)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/11745853_12","volume-title":"Public Key Cryptography - PKC 2006","author":"A. Commeine","year":"2006","unstructured":"Commeine, A., Semaev, I.: An algorithm to solve the discrete logarithm problem with the number field sieve. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 174\u2013190. Springer, Heidelberg (2006)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","first-page":"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.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 1\u201318. Springer, Heidelberg (1999)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-39799-X_3","volume-title":"Advances in Cryptology","author":"W. Jonge De","year":"1986","unstructured":"De Jonge, W., Chaum, D.: Attacks on some RSA signatures. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 18\u201327. Springer, Heidelberg (1986)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1145768.1145785","volume-title":"ISSAC 2006","author":"W. Eberly","year":"2006","unstructured":"Eberly, W., Giesbrecht, M., Giorgi, P., Storjohann, A., Villard, G.: Solving sparse rational linear systems. In: Trager, B.M. (ed.) ISSAC 2006, pp. 63\u201370. ACM Press, New York (2006)"},{"key":"2_CR9","first-page":"143","volume-title":"ISSAC 2007","author":"W. Eberly","year":"2007","unstructured":"Eberly, W., Giesbrecht, M., Giorgi, P., Storjohann, A., Villard, G.: Faster inversion and other black box matrix computations using efficient block projections. In: Brown, C.W. (ed.) ISSAC 2007, pp. 143\u2013150. ACM Press, New York (2007)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-69053-0_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Girault","year":"1997","unstructured":"Girault, M., Misarksy, J.-F.: Selective forgery of RSA signatures using redundancy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 495\u2013507. Springer, Heidelberg (1997)"},{"issue":"72","key":"2_CR11","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"242","author":"A. Joux","year":"2003","unstructured":"Joux, A., Lercier, R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method. Mathematics of Computation\u00a0242(72), 953\u2013967 (2003)","journal-title":"Mathematics of Computation"},{"key":"2_CR12","series-title":"LNM","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0091537","volume-title":"The development of the number field sieve","author":"A.K. Lenstra","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. In: Lenstra, A.K., Lenstra Jr., H.W. (eds.) AMCP 1998. LNM, vol.\u00a01554, pp. 11\u201342. Springer, Heidelberg (1993)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/3-540-45664-3_16","volume-title":"Proceedings of the 5-th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography","author":"A.K. Lenstra","year":"2002","unstructured":"Lenstra, A.K., Shparlinski, I.: Selective forgery of RSA signatures with fixed-pattern padding. In: Proceedings of the 5-th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography. LNCS, vol.\u00a02274, pp. 228\u2013236. Springer, Heidelberg (2002)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BFb0052238","volume-title":"Proceedings of Crypto 1997","author":"J.-F. Misarsky","year":"1997","unstructured":"Misarsky, J.-F.: A multiplicative attack using LLL algorithm on RSA signatures with redundancy. In: Proceedings of Crypto 1997. LNCS, vol.\u00a01294, pp. 221\u2013234. Springer, Heidelberg (1997)"},{"key":"2_CR15","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":"2_CR16","doi-asserted-by":"crossref","unstructured":"Montgomery, P.L.: Square roots of products of algebraic numbers. In: W.\u00a0Gautschi, Ed., Mathematics of Computation 1943\u20131993: A Half-Century of Computational Mathematics, vol.\u00a048 of Proc. Sympos. Appl. Math., pp. 567\u2013571. AMS (1994)","DOI":"10.1090\/psapm\/048\/1314892"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. CACM\u00a021 (1978)","DOI":"10.21236\/ADA606588"},{"key":"2_CR18","unstructured":"RSA Laboratories, pkcs #1 : RSA cryptography specifications, version 2.0 (September 1998)"},{"issue":"1676","key":"2_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O. Schirokauer","year":"1993","unstructured":"Schirokauer, O.: Discrete logarithms and local units. Philos. Trans. Roy. Soc. London Ser. a\u00a0345(1676), 409\u2013423 (1993)","journal-title":"Philos. Trans. Roy. Soc. London Ser. a"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76900-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:45:59Z","timestamp":1619505959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76900-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540768999"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76900-2_2","relation":{},"subject":[]}}