GOST 34.10 - A brief overview of Russia's DSA
暂无分享,去创建一个
[1] C. P. Schnorr,et al. Efficient Identification and Signatures for Smart Cards (Abstract) , 1989, EUROCRYPT.
[2] Holger Petersen,et al. Meta-Multisignature schemes based on the discrete logarithm problem , 1995 .
[3] Chris Charnes,et al. Further Comments on the Soviet Encryption Algorithm , 1994 .
[4] Patrick Horster,et al. Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications , 1994, ASIACRYPT.
[5] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[6] Sung-Ming Yen,et al. The Fast Cascade Exponentation Algorithm and its Applications on Cryptography , 1992, AUSCRYPT.
[7] Claus-Peter Schnorr. E cient Identi cation and Signatures for Smart-Cards , 1990, CRYPTO 1990.
[8] Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.
[9] Rainer A. Rueppel,et al. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.
[10] Daniel Bleichenbacher,et al. Generating EIGamal Signatures Without Knowing the Secret Key , 1996, EUROCRYPT.
[11] Serge Vaudenay,et al. Hidden Collisions on DSS , 1996, CRYPTO.
[12] Jean-Jacques Quisquater,et al. Precautions Taken Against Various Potential Attacks in ISO/IEC DIS 9796 "Digital Signature Scheme Giving Message Recovery" , 1990, EUROCRYPT.
[13] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[14] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[15] Rainer A. Rueppel,et al. Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem , 1996, Des. Codes Cryptogr..