Secure Key Transport in Symmetric Cryptographic Protocols using some Elliptic Curves over finite fields
暂无分享,去创建一个
A. Chandrasekhar | K Vanitha | Suneetha Ch. | D Sravana Kumar | A. Menezes | D. Hankerson | S. Vanstone | D. S. Kumar | C. Suneetha | A. Chandrasekhar | K. Vanitha | E. Verheul | Alfered Menezes
[1] Neal Koblitz,et al. An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm , 1998, CRYPTO.
[2] Atsuko Miyaji,et al. Elliptic Curves over Fp Suitable for Cryptosystems , 1992, AUSCRYPT.
[3] Vipul Gupta,et al. An End-to-End Systems Approach to Elliptic Curve Cryptography , 2002, CHES.
[4] Peter Gemmell,et al. Authenticated Key Exchange Provably Secure Against the Man-in-the-Middle Attack , 2001, Journal of Cryptology.
[5] Antoine Joux,et al. A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.
[6] Wolfgang Bauer. Implementing elliptic curve cryptography , 2002, Communications and Multimedia Security.
[7] Arjen K. Lenstra,et al. Selecting Cryptographic Key Sizes , 2000, Journal of Cryptology.
[8] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .
[9] A. Enge,et al. Elliptic Curves and Their Applications to Cryptography , 1999, Springer US.
[10] Alfred Menezes,et al. Elliptic curve cryptosystems and their implementation , 1993, Journal of Cryptology.