On the Security of RDSA
暂无分享,去创建一个
[1] Johannes Buchmann,et al. A Survey on {IQ} Cryptography , 2001 .
[2] Nigel P. Smart,et al. Lattice Attacks on Digital Signature Schemes , 2001, Des. Codes Cryptogr..
[3] Johannes A. Buchmann,et al. A Signature Scheme Based on the Intractability of Computing Roots , 2002, Des. Codes Cryptogr..
[4] Igor E. Shparlinski,et al. The Insecurity of the Digital Signature Algorithm with Partially Known Nonces , 2002, Journal of Cryptology.
[5] A. K. Lenstra,et al. Factoring polynomials with rational coefficients , 1982 .
[6] J. Pollard,et al. Monte Carlo methods for index computation () , 1978 .
[7] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[8] William M. Daley,et al. Digital Signature Standard (DSS) , 2000 .
[9] Paul C. van Oorschot,et al. On Diffie-Hellman Key Agreement with Short Exponents , 1996, EUROCRYPT.
[10] Jacques Stern,et al. Security Analysis of a Practical "on the fly" Authentication and Signature Generation , 1998, EUROCRYPT.
[11] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[12] Victor Shoup,et al. Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.
[13] Antoine Joux,et al. Lattice Reduction: A Toolbox for the Cryptanalyst , 1998, Journal of Cryptology.
[14] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.
[15] Marc Girault,et al. Self-Certified Public Keys , 1991, EUROCRYPT.