|
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;
LATTICE REDUCTION;
MULTIVARIATE MODULAR EQUATIONS;
PUBLIC KEY CRYPTOGRAPHY;
|
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)
|