Evaluating elliptic curve based KEMs in the light of pairings
暂无分享,去创建一个
[1] Annegret Weng,et al. Elliptic Curves Suitable for Pairing Based Cryptography , 2005, Des. Codes Cryptogr..
[2] G. Frey,et al. A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .
[3] Ueli Maurer,et al. Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1994, CRYPTO.
[4] Victor Shoup,et al. Using Hash Functions as a Hedge against Chosen Ciphertext Attack , 2000, EUROCRYPT.
[5] Paulo S. L. M. Barreto,et al. Generating More MNT Elliptic Curves , 2006, Des. Codes Cryptogr..
[6] R. Balasubramanian,et al. The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm , 1998, Journal of Cryptology.
[7] Nigel P. Smart,et al. The Discrete Logarithm Problem on Elliptic Curves of Trace One , 1999, Journal of Cryptology.
[8] Antoine Joux,et al. A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.
[9] David Pointcheval,et al. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes , 2001, Public Key Cryptography.
[10] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[11] Steven D. Galbraith,et al. Supersingular Curves in Cryptography , 2001, ASIACRYPT.
[12] J. Pollard,et al. Monte Carlo methods for index computation () , 1978 .
[13] Ratna Dutta,et al. Pairing-based cryptography : A survey , 2004 .
[14] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Public Key Cryptography.
[15] N. Smart,et al. The equivalence between the DHP and DLP for elliptic curves used in practical applications , 2004 .
[16] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[17] Ueli Maurer,et al. The Diffie–Hellman Protocol , 2000, Des. Codes Cryptogr..
[18] A. Atkin,et al. ELLIPTIC CURVES AND PRIMALITY PROVING , 1993 .
[19] Ronald Cramer,et al. Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack , 2003, SIAM J. Comput..
[20] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.
[21] Victor Shoup,et al. A Proposal for an ISO Standard for Public Key Encryption , 2001, IACR Cryptol. ePrint Arch..
[22] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[23] Andreas Enge,et al. Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields , 2004, Journal of Cryptology.
[24] Horst G. Zimmer,et al. Constructing elliptic curves with given group order over large finite fields , 1994, ANTS.
[25] Antoine Joux,et al. Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups , 2001, IACR Cryptology ePrint Archive.
[26] Stanislaw Jarecki,et al. A Signature Scheme as Secure as the Diffie-Hellman Problem , 2003, EUROCRYPT.