Small private-exponent attack on RSA with primes sharing bits

Authors:
Yao-Dong Zhao;Wen-Feng Qi
Affiliations:
Department of Applied Mathematics, Zhengzhou Information Engineering University, Zhengzhou, P.R. China;Department of Applied Mathematics, Zhengzhou Information Engineering University, Zhengzhou, P.R. China
Venue:
ISC'07 Proceedings of the 10th international conference on Information Security
Year:
2007

Citing 11
Cited 3

An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
On the Design of RSA with Short Secret Exponent

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
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
Finding Small Roots of Univariate Modular Equations Revisited

Proceedings of the 6th IMA International Conference on Cryptography and Coding
Finding Small Solutions to Small Degree Polynomials

CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
On the Security of RSA with Primes Sharing Least-Significant Bits

Applicable Algebra in Engineering, Communication and Computing
Finding a small root of a univariate modular equation

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Finding a small root of a bivariate integer equation; factoring with high bits known

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Cryptanalysis of RSA with private key d less than N0.292

IEEE Transactions on Information Theory
Cryptanalysis of short RSA secret exponents

IEEE Transactions on Information Theory

On the Improvement of the BDF Attack on LSBS-RSA

ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits

CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Weak keys in RSA with primes sharing least significant bits

Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show in this paper that if the primes share their some bits (e.g. Least-Significant bits), RSA system with small private-exponent is much more vulnerable to the Boneh-Durfee Attack.