Sciweavers

PKC
2010
Springer
138views Cryptology» more  PKC 2010»
13 years 8 months ago
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
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...
Mathias Herrmann, Alexander May