International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Mathias Herrmann
Alexander May
Download:
DOI: 10.1007/978-3-642-13013-7_4
URL: https://www.iacr.org/archive/pkc2010/60560053/60560053.pdf
Search ePrint
Search Google
Presentation: Slides
Conference: PKC 2010
Video from PKC 2010
Video provided under Creative Commons / CC BY 3.0
BibTeX
@inproceedings{pkc-2010-23407,
  title={Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA},
  booktitle={Public Key Cryptography - PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={6056},
  pages={53-69},
  url={https://www.iacr.org/archive/pkc2010/60560053/60560053.pdf},
  doi={10.1007/978-3-642-13013-7_4},
  author={Mathias Herrmann and Alexander May},
  year=2010
}