Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Public Key Cryptography - PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings > Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
Public Key Cryptography - PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings |
Phong Q. Nguyen; David Pointcheval
Springer Berlin Heidelberg
Public Key Cryptography - PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010, Proceedings
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
Authors

Mathias Herrmann; Alexander May

ARI Id

1664911081187_4038784

Access

Not Available Free

Pages

53-69

DOI

10.1007/978-3-642-13013-7_4

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-13013-7_4

Table of Contents of Book
Chapters/HeadingsAuthor(s)PagesInfo
Loading...
Chapters/HeadingsAuthor(s)PagesInfo
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings