Evaluation of Security Level of Cryptography: The Revised Version of PSEC-2 (PSEC-KEM)
暂无分享,去创建一个
[1] Arjen K. Lenstra,et al. Unbelievable Security. Matching AES Security Using Public Key Systems , 2001, ASIACRYPT.
[2] Mihir Bellare,et al. The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES , 2001, CT-RSA.
[3] David Pointcheval,et al. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes , 2001, Public Key Cryptography.
[4] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.
[5] Victor Shoup,et al. A Proposal for an ISO Standard for Public Key Encryption , 2001, IACR Cryptol. ePrint Arch..
[6] A. Menezes. Evaluation of Security Level of Cryptography: The Elliptic Curve Discrete Logarithm Problem (ECDLP) , 2001 .
[7] A. Joux,et al. Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups , 2001, IACR Cryptol. ePrint Arch..
[8] Antoine Joux,et al. Why Textbook ElGamal and RSA Encryption Are Insecure , 2000, ASIACRYPT.
[9] Ronald Cramer,et al. Signature schemes based on the strong RSA assumption , 2000, TSEC.
[10] U. Maurer,et al. The Diffie–Hellman Protocol , 2000, Des. Codes Cryptogr..
[11] Ronald Cramer,et al. Signature schemes based on the strong RSA assumption , 1999, CCS '99.
[12] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .
[13] Dan Boneh,et al. The Decision Diffie-Hellman Problem , 1998, ANTS.
[14] Victor Shoup,et al. Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.
[15] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[16] Richard J. Lipton,et al. Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract) , 1996, CRYPTO.
[17] Ueli Maurer,et al. Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1994, CRYPTO.
[18] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[19] Daniel R. Simon,et al. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.
[20] Bert den Boer. Diffie-Hellman is as Strong as Discrete Log for Certain Primes , 1988, CRYPTO.
[21] N. Koblitz. Elliptic curve cryptosystems , 1987 .
[22] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.
[23] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[24] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[25] J. Pollard,et al. Monte Carlo methods for index computation () , 1978 .