View : 16 Download: 0

The better bound of private key in RSA with unbalanced primes

Title
The better bound of private key in RSA with unbalanced primes
Authors
Hong H.-S.Lee H.-K.Lee H.-S.Lee H.-J.
Ewha Authors
이향숙
SCOPUS Author ID
이향숙scopus
Issue Date
2003
Journal Title
Applied Mathematics and Computation
ISSN
0096-3003JCR Link
Citation
vol. 139, no. 2-3, pp. 351 - 362
Indexed
SCIE; SCOPUS WOS scopus
Abstract
At Asiacrypt '99, Sun, Yang and Laih proposed three different schemes of RSA cryptosystem to avoid all known attacks including Boneh-Durfee attack. One year after, Durfee and Nguyen attacked two out of these three schemes based on Coppersmith's lattice technique for finding small roots to trivariate modular polynomial equations. The bounds of private key for the first and third schemes were much improved, but the bound of the second scheme was not good enough. Our result improves Durfee and Nguyen's bound of the private exponent d from N 0.483 to N 0.486 for the second scheme. This implies the system is insecure if the private exponent d<N 0.486. © 2002 Elsevier Science Inc. All rights reserved.
DOI
10.1016/S0096-3003(02)00198-4
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE