On efficient inversion in tower fields of characteristic two

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1997, Pages 20-

  Fan, John L ^a   Paar, Christof ^b  

^a Stanford University   (United States)

^b WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

ASYMPTOTIC COMPLEXITY; TOWER FIELDS;

RECURSIVE FUNCTIONS;

EID: 0030685933     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.612935     Document Type: Conference Paper

References (5)

1. M. Morii and M. Kasahara. "Efficient construction of gate circuit for computing multiplicative inverses over GF (2,)." Transactions of the IEICE, E 72(1):37-42, January 1989.
2. V.B. Afanasyev. On the Complexity of Finite Field Arithmetic, 5th Joint Soviet-Swedish Intern. Workshop on IT, Moscow, USSR, Jan. 1991.
3. C. Paar. "Some Remarks on Efficient Inversion in Finite Fields," ISIT 95, Whistler, B.C. Canada, September 17-22 1995.
4. Blake, Gao, Mullin, Vanstone, and Yaghoobian. Applications of Finite Fields. Kluwer Academic Publisher, 1993.
5. C. Paar. "A new architecture for a parallel finite field multiplier with low complexity based on composite fields." IEEE Transactions on Computers, 45(7):856-861, July 1996