The modular inversion hidden number problem (2001)

Cached

Download Links

by Dan Boneh , Shai Halevi , Nick Howgrave-graham
Venue:In ASIACRYPT 2001, volume 2248 of LNCS
Citations:13 - 1 self

Documents Related by Co-Citation

98 Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes – D Boneh, R Venkatesan
750 Factoring polynomials with rational coefficients – A. K. Lenstra, H. W. Lenstra - 1982
68 The Insecurity of the Digital Signature Algorithm with Partially Known Nonces – Phong Q. Nguyen, Igor E. Shparlinski - 2000
623 How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits – M Blum, S Micali - 1984
729 Cryptography: Theory and Practice – D Stinson - 1995
1194 Geometric Algorithms and Combinatorial Optimization – M Grotschel, L Lov'asz, A Schrijver - 1988
705 Public-key cryptosystems based on composite degree residuosity classes – Pascal Paillier - 1999
905 The arithmetic of elliptic curves – J Silverman - 1986
1246 Identity-Based Encryption from the Weil Pairing – Dan Boneh, Matthew Franklin - 2001