Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
On the Security of the KMOV Public Key Cryptosystem
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Finding Small Roots of Univariate Modular Equations Revisited
Proceedings of the 6th IMA International Conference on Cryptography and Coding
On the fly signatures based on factoring
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Lattice Attacks on Digital Signature Schemes
Designs, Codes and Cryptography
On the Security of the Digital Signature Algorithm
Designs, Codes and Cryptography
The better bound of private key in RSA with unbalanced primes
Applied Mathematics and Computation
Secure and Private Distribution of Online Video and Some Related Cryptographic Issues
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Improving SSL Handshake Performance via Batching
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Privacy Protection for Transactions of Digital Goods
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the Insecurity of a Server-Aided RSA Protocol
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Low Secret Exponent RSA Revisited
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Finding smooth integers in short intervals using CRT decoding
Journal of Computer and System Sciences - Special issue on STOC 2000
Searching Worst Cases of a One-Variable Function Using Lattice Reduction
IEEE Transactions on Computers
Protocols that hide user's preferences in electronic transactions
Computer Networks: The International Journal of Computer and Telecommunications Networking
A variant of Wiener's attack on RSA with small secret exponent
ACM Communications in Computer Algebra
A New Class of Weak Encryption Exponents in RSA
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Factorization of Square-Free Integers with High Bits Known
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Cryptanalysis of RSA Using the Ratio of the Primes
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Protocols that hide user's preferences in electronic transactions
Computer Networks: The International Journal of Computer and Telecommunications Networking
ShortPK: A short-term public key scheme for broadcast authentication in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Finding small roots of bivariate integer polynomial equations: a direct approach
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Another generalization of Wiener's attack on RSA
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Solving generalized small inverse problems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Factorization of square-free integers with high bits known
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Another look at small RSA exponents
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
RSA with balanced short exponents and its application to entity authentication
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Multi-modal biometrics with PKI technologies for border control applications
ISI'05 Proceedings of the 2005 IEEE international conference on Intelligence and Security Informatics
A provably secure elliptic curve scheme with fast encryption
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Maximizing small root bounds by linearization and applications to small secret exponent RSA
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Rankin's constant and blockwise lattice reduction
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
A unified framework for small secret exponent attack on RSA
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Partial key exposure on RSA with private exponents larger than N
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
A new attack on RSA and CRT-RSA
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Cryptanalysis of RSA with a small parameter
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
On the optimality of lattices for the coppersmith technique
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
RSA vulnerabilities with small prime difference
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
Side channel attack to actual cryptanalysis: breaking CRT-RSA with low weight decryption exponents
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Cryptanalysis of exhaustive search on attacking RSA
NSS'12 Proceedings of the 6th international conference on Network and System Security
| Hi-index | 0.00 |
We show that if the private exponent d used in the RSA public-key cryptosystem is less than N0:292 then the system is insecure. This is first improvement over an old result of Wiener showing that when d N0:25 the RSA system is insecure. We hope our approach can be used to eventually improve the bound to d N0:5.