A Survey on IQ Cryptography (2001)

by Johannes Buchmann , Safuat Hamdy
Venue:In Proceedings of Public Key Cryptography and Computational Number Theory
Citations:3 - 1 self

Documents Related by Co-Citation

1 On the Security of RDSA 475 – A Fiat, A Shamir - 1987
220 Lower Bounds for Discrete Logarithms and Related Problems – Victor Shoup - 1997
278 Security Arguments for Digital Signatures and Blind Signatures – David Pointcheval, Jacques Stern - 2000
59 On Diffie-Hellman Key Agreement with Short Exponents – Paul C. van Oorschot, Michael J. Wiener - 1996
230 Monte Carlo Methods for Index Computation (mod p – J M Pollard - 1978
45 Bounds for Discrete Logarithms and Related Problems – Lower - 1997
37 Lattice attacks on digital signature schemes – N. A. Howgrave-graham, N. P. Smart - 1999
66 The Insecurity of the Digital Signature Algorithm with Partially Known Nonces – Phong Q. Nguyen, Igor E. Shparlinski - 2000
55 Lattice Reduction: a Toolbox for the Cryptanalyst – Antoine Joux, Jacques Stern - 1994
28 Security Analysis of a Practical "on the fly" Authentication and Signature Generation – Guillaume Poupard, Jacques Stern - 1998
4 A Signature Scheme Based on the Intractability of Computing Roots – Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer - 2000
581 Efficient signature generation by smart cards – C P Schnorr - 1991
108 Self-certified public keys – M Girault - 1992
830 How To Prove Yourself: Practical Solutions to Identification and Signature Problems – Amos Fiat, Adi Shamir - 1987
311 Efficient Identification and Signature for Smart Cards – C Schnorr - 1989
706 Factoring polynomials with rational coefficients – A. K. Lenstra, H. W. Lenstra - 1982
1 exponentiation with precomputation – Fast - 1993
1 Problems and solutions: Addition chains of vectors – E Straus - 1964
6 A signature scheme based on the intractability of extracting roots – Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer - 2000