Cryptanalysis of RSA with small prime difference

Applicable Algebra in Engineering, Communications and Computing

Volumn 13, Issue 1, 2002, Pages 17-28

  De Weger, Benne ^a  

^a 2924 XN Krimpen Aan Den IJssel ^*  (Netherlands)

Author keywords

Boneh Durfee attack; Cryptanalysis; Fermat factoring; RSA; Wiener attack

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; HEURISTIC METHODS; INVERSE PROBLEMS; POLYNOMIALS; RANDOM NUMBER GENERATION; SECURITY OF DATA;

BONEH-DURFEE ATTACK; FERMAT FACTORING; MODULUS; PRIME DIFFERENCE; WIENER ATTACK;

DIGITAL ARITHMETIC;

EID: 0036542020     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000100088     Document Type: Article

References (12)

1. User's guide to pari-GP
2. 0.292 advances in cryptology - EUROCRYPT'99
3. New results on the cryptanalysis of low exponent RSA
4. Finding a small root of a univariate modular equation, advances in cryptology - EUROCRYPT'96
5. Finding a small root of a bivariate integer equation; factoring with high bits known, advances in cryptology - EUROCRYPT'96
6. Finding small roots of univariate modular equations revisited, proceedings of cryptography and coding
7. Fast generation of random, strong RSA primes
8. Cryptanalysis of 'less short' RSA secret exponents, applicable algebra in engineering
9. Cryptanalysis of short RSA secret exponents