{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:56:15Z","timestamp":1725533775150},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642023835"},{"type":"electronic","value":"9783642023842"}],"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-02384-2_7","type":"book-chapter","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T04:37:08Z","timestamp":1245299828000},"page":"98-115","source":"Crossref","is-referenced-by-count":5,"title":["Cryptanalysis of RSA Using the Ratio of the Primes"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24632-9_1","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Bl\u00f6mer","year":"2004","unstructured":"Bl\u00f6mer, J., May, A.: A generalized Wiener attack on RSA. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 1\u201313. Springer, Heidelberg (2004)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48910-X_1","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N\n                  0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 1\u201311. Springer, Heidelberg (1999)"},{"key":"7_CR3","first-page":"149","volume":"8","author":"R.P. Brent","year":"1986","unstructured":"Brent, R.P.: Some integer factorization algorithms using elliptic curves. Australian Computer Science Communications\u00a08, 149\u2013163 (1986)","journal-title":"Australian Computer Science Communications"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44968-X_2","volume-title":"Computing and Combinatorics","author":"R.P. Brent","year":"2000","unstructured":"Brent, R.P.: Recent progress and prospects for integer factorisation algorithms. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 3\u201322. Springer, Heidelberg (2000)"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"Journal of Cryptology"},{"key":"7_CR6","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1965","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. Oxford University Press, London (1965)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1090\/S0025-5718-1974-0340163-2","volume":"28","author":"R.S. Lehman","year":"1974","unstructured":"Lehman, R.S.: Factoring large integers. Mathematics of Computation\u00a028, 637\u2013646 (1974)","journal-title":"Mathematics of Computation"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126, 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra, H.W., Manasse, M.S., Pollard, J.M.: The number field sieve. In: Proc. 22nd Annual ACM Conference on Theory of Computing, Baltimore, Maryland, pp. 564\u2013572 (1990)","DOI":"10.1145\/100216.100295"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048, 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"key":"7_CR11","first-page":"183","volume":"29","author":"M.A. Morrison","year":"1975","unstructured":"Morrison, M.A., Brillhart, J.: A method of factoring and the factorization of F7. Math. of Comput.,\u00a029, 183\u2013205 (1975)","journal-title":"Math. of Comput.,"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Nitaj, A.: Cryptanalysis of RSA with constrained keys. International Journal of Number Theory (to appear)","DOI":"10.1142\/S1793042109002122"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-68164-9_12","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"A. Nitaj","year":"2008","unstructured":"Nitaj, A.: Another generalization of Wiener\u2019s attack on RSA. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 174\u2013190. Springer, Heidelberg (2008)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT\u00a015, 331\u2013334 (1975)","journal-title":"BIT"},{"issue":"2","key":"7_CR15","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(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1090\/S0025-5718-1987-0866119-8","volume":"48","author":"R.D. Silverman","year":"1987","unstructured":"Silverman, R.D.: The multiple polynomial quadratic sieve. Mathematics of Computation\u00a048, 329\u2013339 (1987)","journal-title":"Mathematics of Computation"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M. Wiener","year":"1990","unstructured":"Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory\u00a036, 553\u2013558 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR18","unstructured":"Zimmermann, P.: 50 largest factors found by ECM, \n                    \n                      http:\/\/www.loria.fr\/~zimmerma\/records\/top50.html"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02384-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T21:54:34Z","timestamp":1552082074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02384-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023835","9783642023842"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02384-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}