3 search results - page 1 / 1 » Maximizing Small Root Bounds by Linearization and Applicatio... |
PKC
2010
Springer
13 years 8 months ago
2010
Springer
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
PKC
2005
Springer
13 years 9 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
CRYPTO
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...