Elliptic curve cryptography over binary finite field GF(2m)

Information Technology Journal

Volumn 5, Issue 1, 2006, Pages 204-229

  Rabah, Kefa ^a  

^a EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

Author keywords

Cryptography; Data security; DH; ECC; ECDSA; ElGamal; IPsec; OpenSSL; RSA; Secure communication; TLS; Wireless

Indexed keywords

DH; ECC; ECDSA; ELGAMAL; IPSEC; OPENSSL; RSA; SECURE COMMUNICATION; TLS;

BANDWIDTH; INFORMATION TECHNOLOGY; NETWORK PROTOCOLS; PERSONAL DIGITAL ASSISTANTS; SECURITY OF DATA; SMART CARDS; WIRELESS TELECOMMUNICATION SYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33644601461     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2006.204.229     Document Type: Article

References (51)

1. Rabah, K., 2004. Data security and cryptographic techniques: A review. ITJ., 3: 106-132.
2. Data Encryption Standard, 1977. Federal Information Processing Standard (FIPS) Publication 46, National Bureau of Standards, US., Washington D.C.
3. Rabin, M.O., 1979. Digital signature and public-key functions as intractable as factorization. MIT Laboratory of Computer Science, Technical Report, MIT/LCS/TR-212.
4. Rivest, R., A. Shamir and L. Adleman, 1978. A method for obtaining digital signatures and public key cryptosystems. Comm. ACM., 21: 120-126.
5. Menezes, A., P. Van Oorschot and S. Vanstone, 1997. Handbook of Applied Cryptography. CRC Press.
6. Koblitz, N., 1987. Elliptic curve cryptosystems. Mathematics of Computation, 48: 203-209.
7. Miller, V., 1986. Use of elliptic curves in cryptography. In: CRYPTO '85, pp: 417-426.
8. Rabah, K., 2005. Theory and implementation of elliptic curve cryptography. J. Applied Sci., 5: 604-633.
9. Koblitz, N., 1994. A Course in Number Theory and Cryptography. Springer Verlag.
10. Lenstra, A.K. and E.R. Verheul, 1999. Selecting cryptographic key sizes. J. Cryptol., J. Intl. Assoc. Cryptol. Res., Vol: 12.
11. Menezes, A.J., 1993. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers.
12. IEEE P1363a: http://grouper.ieee.org/groups/1363/P1363a/
13. ANSI X9.62, 1999. The Elliptic Curve Digital Signature Algorithm (ECDSA). American Bankers Association.
14. Rabah, K., 2005. Implementation of elliptic curve diffie-hellman and EC encryption schemes. ITJ., 4: 132-139.
15. Rabah, K., 2005. Elliptic curve elgamal signature and encryption schemes. (In Press).
16. Rabah, K., 2005. Theory and implementation of data encryption standard: A review. (In Press).
17. US, Department of Commerce/National Institute of Standards and Technology, 1997. Announcing request for candidate algorithm nominations for the Advanced Encryption Standard (AES). World Wide Web. http://csrc.nist.gov/ encryption/aes/pre-round1/aes_9709.htm
18. ISO/IEC: http://grouper.ieee.org/groups/1363/Research/Other.html
19. IEEE PI363, 2000. Standard Specifications for Public-key Cryptography.
20. National Institute of Standards and Technology, 1999. Recommended elliptic curves for federal government use. http://csrc.nist.gov/encryption.
21. Schroeppel, R., H. Orman, S. O'Malley and O. Spatscheck, 1995. Fast Key Exchange with Elliptic Curve Systems. Advances in Cryptology-Crypto '95, LNCS 963, Springer-Verlag, pp: 43-56.
22. Schroeppel, R., C. Beaver, R. Gonzales, R. Miller and T. Draelos, 2002. A low-power design for an elliptic curve digital signature chip. Presented at Cryptographic Hardware and Embedded Systems (CHES).
23. n). Advances in Cryptology-ASIACRYPT '96, LNCS 1163, Springer-Verlag, pp: 65-76.
24. Lenstra, A. and E. Verheul, 2000. Selecting Cryptographic Key Sizes. In: Imai, H. and Y. Zheng, Eds., PKC 2000, volume LNCS 1751, Berlin, Springer-Verlag.
25. Bailey, D. and C. Paar, 2001. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J. Cryptol., Vol: 14.
26. Woodbury, A., D.V. Bailey and C. Paar, 2002. Elliptic Curve Cryptography on Smart Cards Without Coprocessors. In: CARDIS 2000, Bristol, UK, September 20th, Kluwer.
27. Beth, T. and F. Schaefer, 1991. Non-Supersingular Elliptic Curves for Public Key Cryptosystems. LNCS 547, Advances in Cryptology-Eurocrypt '91, Brighton, United Kingdom, Davies, D.W. (Ed.), Springer-Verlag, pp: 252-266.
28. m) using normal basis. Inform. Comput. J., 78: 171-177.
29. Wu, H., 1999. Low Complexity Bit-parallel Finite Field Arithmetic Using Polynomial Basis. In: Koc, C. and C. Paar, Eds., Workshop on Cryptographic Hardware and Embedded Systems (CHES '99), volume LNCS 1717. Springer-Verlag.
30. Paar, C., P. Fleischmann and P. Soria-Rodriguez, 1999. Fast arithmetic for public-key algorithms in galois fields with composite exponents. IEEE Trans. Computers, 48: 1025-1034.
31. m) and its applications in cryptographic systems. Elect. Lett., 36: 1116-1117.
32. Weil's Conjecture, Proved by Helmut Hasse in 1934.
33. Silverman, J.H., 1985. The Arithmetic of Elliptic Curves. Springer-Verlag.
34. Georg-Johann, L. and Z. Horst-Günter, 1994. Constructing Elliptic Curves with given Group Order over Large Finite Fields. LNCS 877, Algorithmic Number Theory, The 1st Intl. Symposium, ANTS-I, Ithaca, Springer-Verlag, pp: 250-263.
35. m). Research Manuscript, Hewlett-Packard Laboratories.
36. Lenstra, H.W.Jr. and R. Schoof, 1987. Primitive normal basis for finite fields. Math. Comput., 48: 217-231.
37. m). J. Cryptol., 6: 3-13.
38. n). Discrete Applied Math., 22: 149-161.
39. Rabah, K., Secure Implementing Message Digest. Authentication and Digital Signature, In Press.
40. Diffie, W. and M.E. Hellman, 1966. New directions in cryptography. IEEE Tran. Inform. Theory, 22: 644-654.
41. Bellovin, S.M. and M. Merritt, 1992. Encrypted key exchange: Password-based protocols secure against dictionary attacks. Proc. 1992 IEEE Computer Soc. Conf. Res. Security and Privacy, pp: 72-84.
42. Pollard, J.M., 1978. Monte Carlo methods for index computation (mod p). Math. Comput., 32: 918-924.
43. Hellman, M. and J. Reyneri, 1983. Fast Computation of Discrete Logarithms in GF(q). In: Advances in Cryptology: Proc. Crypto '82. Plenum Press.
44. Lim, C. and P. Lee, 1997. A key recovery attack on discrete log-based schemes using a prime order subgroup. Advances in Cryptology-Crypto '97, Lecture Notes in Computer Science, 1294: 249-263.
45. Koyama, K., U.M. Maurer, T. Okamoto and S.A. Vanstone, 1992. New Public-key Scheme Based on Elliptic Curves over the Ring Zn. LNCS 576, Advances in Cryptology-Crypto '91, Barbara, S. and J. Feigenbaum (Eds.), Springer-Verlag, California, pp: 252-266.
46. ANSI key schemes FIPS 140-2. http://cio.doe.gov/Publications/profile2000/ Profile2000_AppendixA.htm
47. Basham, L., D. Johnson and T. Polk, 1999. Representation of Elliptic Curve Digital Signature Algorithm (ECDSA) keys and signatures in internet X.509 public-key infrastructure certificates. Internet Draft, http://www.ietf.org, pp: 252-266.
48. ElGamal, T., 1985. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Infor. Theory, 31: 469-472.
49. Diffie, W., P.V. Oorschot and M. Wiener, 1992. Authentication and authenticated key exchanges. Designs, Codes and Cryptography, 2: 107-125.
50. Sutikno, S., R. Effendi and A. Surya, 1998. Design and implementation of arithmetic processor F2155 for elliptic curve cryptosystems. In: 1998 IEEE Asia-Pacific Conference on Circuits and Systems, pp: 647-650.
51. Paar, C., 1993. A parallel galois field multiplier with low complexity based on composite fields. 6th Joint Swedish-Russian Workshop on Information Theory, Mölle, Sweden, pp: 320-324.