{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:27:53Z","timestamp":1775471273139,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681595","type":"print"},{"value":"9783540681649","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68164-9_12","type":"book-chapter","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T06:48:34Z","timestamp":1212130114000},"page":"174-190","source":"Crossref","is-referenced-by-count":30,"title":["Another Generalization of Wiener\u2019s Attack on RSA"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1112\/S0025579300002588","volume":"15","author":"A. Baker","year":"1966","unstructured":"Baker, A.: Linear forms in the logarithms of algebraic numbers IV. Mathematika\u00a015, 204\u2013216 (1966)","journal-title":"Mathematika"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","first-page":"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":"12_CR3","series-title":"Lecture Notes in Computer Science","first-page":"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":"12_CR4","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":"12_CR5","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":"12_CR6","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":"12_CR7","unstructured":"Ferguson, H.R.P., Bailey, D.H.: A polynomial time, numerically stable integer relation algorithm. RNR Technical Report RNR-91-032, NASA Ames Research Center, Moffett Field, CA (December 1991)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1098\/rsta.1993.0133","volume":"345","author":"J. Friedlander","year":"1993","unstructured":"Friedlander, J., Granville, A.: Smoothing \u201cSmooth\u201d Numbers. Philos. Trans. Roy. Soc. London Ser.\u00a0345, 339\u2013347 (1993)","journal-title":"Philos. Trans. Roy. Soc. London Ser."},{"key":"12_CR9","volume-title":"Proc. MSRI Conf. Algorithmic Number Theory: Lattices, Number Fields, Curves, and Cryptography","author":"A. Granville","year":"2000","unstructured":"Granville, A.: Smooth numbers: computational number theory and beyond. In: Buhler, J., Stevenhagen, P. (eds.) Proc. MSRI Conf. Algorithmic Number Theory: Lattices, Number Fields, Curves, and Cryptography, Berkeley, Cambridge University Press, Cambridge (2000)"},{"key":"12_CR10","volume-title":"Divisors. Cambridge Tracts in Mathematics","author":"R.R. Hall","year":"1988","unstructured":"Hall, R.R., Tenenbaum, G.: Divisors. Cambridge Tracts in Mathematics, vol.\u00a090. Cambridge University Press, Cambridge (1988)"},{"key":"12_CR11","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":"12_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0022-314X(86)90013-2","volume":"22","author":"A. Hildebrand","year":"1986","unstructured":"Hildebrand, A.: On the number of positive integers \u2264\u2009x and free of prime factors >\u2009y. J. Number Theory\u00a022, 289\u2013307 (1986)","journal-title":"J. Number Theory"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Cryptography and Coding","author":"N.A. Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.A.: Finding small roots of univariate modular equations revisited. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"12_CR14","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":"12_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"12_CR16","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":"12_CR17","unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods, Ph.D. thesis, Paderborn (2003), \n                    \n                      http:\/\/www.informatik.tu-darmstadt.de\/KP\/publications\/03\/bp.ps"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","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":"12_CR19","unstructured":"PARI\/GP, version 2.1.7, Bordeaux (2007), \n                    \n                      http:\/\/pari.math.u-bordeaux.fr\/"},{"issue":"2","key":"12_CR20","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"},{"issue":"1","key":"12_CR21","first-page":"17","volume":"13","author":"B. Weger de","year":"2002","unstructured":"de Weger, B.: Cryptanalysis of RSA with small prime difference, Applicable Algebra in Engineering. Communication and Computing\u00a013(1), 17\u201328 (2002)","journal-title":"Communication and Computing"},{"key":"12_CR22","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":"12_CR23","unstructured":"Zimmerman, P.: The ECMNET Project, \n                    \n                      http:\/\/www.loria.fr\/~zimmerma\/records\/ecmnet.html"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68164-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:38:49Z","timestamp":1620002329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68164-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681595","9783540681649"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68164-9_12","relation":{},"subject":[]}}