An alternate approach to modular multiplication for finite fields [GF (2m)] using Itoh Tsujii algorithm

3rd International IEEE Northeast Workshop on Circuits and Systems Conference, NEWCAS 2005

Volumn 2005, Issue , 2005, Pages 103-105

  Bharathwaj, Sankara Viswanathan ^a   Narasimhan, Kishore Lakshmi ^a  

^a SRI VENKATESWARA COLLEGE OF ENGINEERING   (India)

Author keywords

High word size; Itoh Tsuji; Modular multiplier; Scalability and pipelining

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; ENCODING (SYMBOLS); ERROR ANALYSIS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

ARITHMETIC OPERATIONS; HIGH WORD SIZE; ITOH TSUJI; MODULAR MULTIPLIERS; SCALABILITY AND PIPELINING;

DIGITAL ARITHMETIC;

EID: 33745793234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NEWCAS.2005.1496668     Document Type: Conference Paper

References (7)

1. J. Guajardo and C. Paar. Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography. Design, Codes, and Cryptography, (25): 207-216, 2002
2. Advanced Encryption Standard (AES), Federal Information Processing Standards Publication 197, November 26, 2001.
3. m) ", IEEE Transactions on Computers, Vol. 42, No. 8, August 1993, pp. 1010-1015.
4. T. Itoh and S. Tsujii. "A Fast Algorithm for Computing Multiplicative Inverses in GF(2m) Using Normal Bases". Information and Computation, 78: 171-177, 1988.
5. E. D. Mastrovito. VLSI Architectures for Computations in Galois Fields. Dept. Electrical Engg., Linkoping, Sweden, 1991.
6. J. L. Massey and J. K. Omura. Computational method and apparatus for finite field arithmetic. U.S. Patent Application, 1981.
7. m)". IEEE Transactions on Computers, 41(8): 972-980, Aug 1992.