An reconfigurable multiplier in GF(2m) for Elliptic Curve Cryptosystem

Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems

Volumn 2, Issue , 2003, Pages 699-702

  Kitsos, P ^a   Theodoridis, G ^b   Koufopavlou, O ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-SERIAL; EFFICIENT ARCHITECTURE; ELLIPTIC CURVE CRYPTOSYSTEM; GALOIS FIELDS; HARDWARE COMPLEXITY; HIGH ORDER; IRREDUCIBLE POLYNOMIALS; ITS EFFICIENCIES; PROPOSED ARCHITECTURES; RE-CONFIGURABLE; SMALL AREA; POLYNOMIAL BASIS MULTIPLIERS; RECONFIGURABLE;

CRYPTOGRAPHY; GEOMETRY;

FREQUENCY MULTIPLYING CIRCUITS; RECONFIGURABLE ARCHITECTURES;

EID: 33750839174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICECS.2003.1301881     Document Type: Conference Paper

References (18)

1. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, "Handbook of Applied Cryptography", CKC Press, 1997.
2. C. Paar and N. Lange, "A Comparative VLSI Synthesis of Finite Field Multipliers", Third International Symposium of Commnnication Theory and Its Applications, Lake District, U.K., July 1995.
3. C. K. Koç, B. Sunar, "Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields", IEEE Transactions on Computers, Vol.47 (3), pp. 353-356, March 1998.
4. m)", IEEE Transactions Computers, Vol.41 (8), pp. 962-971, August 1992.
5. H. Wu, "Low complexity bit-parallel fnite field arithmetic using polynomial basis", Cryptographic Hardware and Embedded Systems-CHES 1999. LNCS, Vol.1717, pp. 280-291, Springer-Verlag. Worcester, MA, USA, 1999.
6. m)", Journal of Information Science and Engineering, Vol. 18 (4), pp. 479-488, July 2002.
7. C. Paar, P. Fleischmann, and P. Soria-Rodriguez, "Fast Arithmetic for Public-Key Algorithms in Galois Field with Composite Exponents", IEEE Transaction of Computers, Vol.48 (10), pp. 1025-1034, October 1999.
8. M. A. Hasan and M. Ebtedaei, "Efficient Architectures for Computations over Variable Dimensional Galois Field," IEEE Transaction on Circuits and Systems-I: Fundamentals Theory and Applications, Vol. 45 (1 I), November 1998.
9. m)", Cryptographic Hardware and Embedded Systems-CHES 2000, LNCS, Vol.1965, pp. 277-292. Springer-Verlag. Berlin, Germany, 2000.
10. N. Kohlitz, "Elliptic curve cryptosystems", Mathematics of Computation, Vol.48, pp. 203-209, 1987.
11. V. Miller, "Uses of elliptic cwes in cryptography". Advances in Cryptology - CRYPT0 '85, LNCS, Vol. 218, pp. 417-426, Berlin, Germany, 1986.
12. K. Lidl and H. Niederreiter, "Introduction to Finite Fields and Their Applications", Cambridge: Cambridge University Press, 1986.
13. m)", IEEE Transactions Computers, Vol.41 (8), pp, 962-971, August 1992.
14. m)", IEEE Journal on Selected Areas in Communications, Vol. sac-4, pp. 62-65, January 1986.
15. S. Nandi, B. K. Kar, and P. Pal Chaudhui, "Theory and Applications of Cellular Automata in Cryptography", IEEE Transaction of Computers, Vol.43 (12), pp. 1346- 1357, December 1994.
16. Nigel P. Smart, "How Secure Are Elliptic Curves over Composite Extension Fields?", Advances in Cryptology - EUROCKYPT 2001, Innsbruck, Austria, May 6-10,2001, pp, 30-39.
17. m)", Designs, Codes and Cryptography, Vol. 14(1), pp. :57-69, April 1998.
18. CERTICOM Corporation, "The Elliptic Curve Cwtosystem for Smart Card", on line available at http://www.cenicom.com/resources/downloadECC- SC.pdf