메뉴 건너뛰기




Volumn 139, Issue 2-3, 2003, Pages 351-362

The better bound of private key in RSA with unbalanced primes

Author keywords

Coppersmith's technique; Geometrically progressive matrices; Lattice reduction; Multivariate modular equations; RSA attack

Indexed keywords

COMPUTER CRIME; MATRIX ALGEBRA; POLYNOMIALS; SECURITY OF DATA;

EID: 0037448163     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(02)00198-4     Document Type: Article
Times cited : (6)

References (12)
  • 1
    • 0000552770 scopus 로고    scopus 로고
    • Twenty years of attacks on the RSA cryptosystem
    • Boneh D. Twenty years of attacks on the RSA cryptosystem. Notices AMS. 46(2):1999;203-213.
    • (1999) Notices AMS , vol.46 , Issue.2 , pp. 203-213
    • Boneh, D.1
  • 3
    • 0001494997 scopus 로고    scopus 로고
    • Small solutions to polynomial equations and low exponent RSA vulnerabilities
    • Coppersmith D. Small solutions to polynomial equations and low exponent RSA vulnerabilities. J. Cryptol. 10:1997;233-260.
    • (1997) J. Cryptol. , vol.10 , pp. 233-260
    • Coppersmith, D.1
  • 4
    • 0012132089 scopus 로고    scopus 로고
    • Cryptanalysis of RSA with short secret exponent from Asiacrypt '99
    • LNCS, IACR, Berlin: Springer-Verlag
    • Durfee G., Nguyen Phong Q. Cryptanalysis of RSA with short secret exponent from Asiacrypt '99. Proceedings of Asiacrypt 2000, LNCS, IACR. 2000;1-11 Springer-Verlag, Berlin.
    • (2000) Proceedings of Asiacrypt 2000 , pp. 1-11
    • Durfee, G.1    Nguyen Phong, Q.2
  • 5
    • 84949226531 scopus 로고    scopus 로고
    • Finding small roots of univariate modular equations revisited
    • LNCS, Berlin: Springer-Verlag
    • Howgrave-Graham N. Finding small roots of univariate modular equations revisited. Proceedings Cryptography and Coding, LNCS, vol. 1355. 1997;131-142 Springer-Verlag, Berlin.
    • (1997) Proceedings Cryptography and Coding , vol.1355 , pp. 131-142
    • Howgrave-Graham, N.1
  • 6
    • 34250244723 scopus 로고
    • Factoring polynomials with rational coefficients
    • Lenstra A.K., Lenstra H.W. Jr., Lovaz L. Factoring polynomials with rational coefficients. Mathemat. Ann. 261:1982;513-534.
    • (1982) Mathemat. Ann. , vol.261 , pp. 513-534
    • Lenstra, A.K.1    Lenstra H.W., Jr.2    Lovaz, L.3
  • 9
    • 84956867073 scopus 로고    scopus 로고
    • On the design of RSA with short secret exponent
    • LNCS, IACR, Berlin: Springer-Verlag
    • Sun H.-M., Yang W.-C., Laih C.-S. On the design of RSA with short secret exponent. Proceedings of Asiacrypt 2000, LNCS, IACR, vol. 1716. 1999;150-164 Springer-Verlag, Berlin.
    • (1999) Proceedings of Asiacrypt 2000 , vol.1716 , pp. 150-164
    • Sun, H.-M.1    Yang, W.-C.2    Laih, C.-S.3
  • 11
    • 0012132905 scopus 로고    scopus 로고
    • W. Maple, Available from < http://www.maplesoft.com/products/Maple6>.
    • Maple, W.1
  • 12
    • 0025430939 scopus 로고
    • Cryptanalysis of short RSA secret exponents
    • Wiener M. Cryptanalysis of short RSA secret exponents. IEEE Trans. Inform. Theory. 36(3):1990;553-558.
    • (1990) IEEE Trans. Inform. Theory , vol.36 , Issue.3 , pp. 553-558
    • Wiener, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.