Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA

@inproceedings{Herrmann2010MaximizingSR,
  title={Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA},
  author={Mathias Herrmann and Alexander May},
  booktitle={Public Key Cryptography},
  year={2010}
}
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 in a generic way from a polynomial f and then optimize via finding suitable smaller dimensional sublattices. In contrast, our method focuses on optimizing f first which then directly leads to an optimized small dimensional lattice. Using our method, we construct the first elementary proof of the Boneh-Durfee attack for… CONTINUE READING
BETA
Highly Cited
This paper has 41 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 18 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

LNCS, vol

  • ASIACRYPT
  • 5912, pp. 487–504. Springer, Heidelberg
  • 2009
2 Excerpts

LNCS, vol

  • PKC
  • 3958, pp. 1–13. Springer, Heidelberg ()
  • 2006

Similar Papers

Loading similar papers…