Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,052,324 papers from all fields of science
Search
Sign In
Create Free Account
Coppersmith method
The Coppersmith method, proposed by Don Coppersmith, is a method to find small integer zeroes of univariate or bivariate polynomials modulo a given…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Coppersmith's attack
Cryptography
Lenstra–Lenstra–Lovász lattice basis reduction algorithm
Newton's method
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Generalization of Some Attacks on RSA with Small Prime Combination and Small Private Exponent
Lidong Han
,
Guangwu Xu
Asia-Pacific Conference on Information Processing
2009
Corpus ID: 15756831
In 2002, de Weger proposed an attack on small RSA secret decryption exponent with small prime difference |p-q|, which improved…
Expand
2001
2001
The index calculus method using non-smooth polynomials
T. Garefalakis
,
D. Panario
Mathematics of Computation
2001
Corpus ID: 3116948
We study a generalized version of the index calculus method for the discrete logarithm problem in F q , when q = p n , p is a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE