On "a new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits"

IEEE Transactions on Computers

Volumn 51, Issue 12, 2002, Pages 1460-1461

  Geiselmann, Willi ^a   Müller Quade, Jörn ^a   Steinwandt, Rainer ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Galois field arithmetic; VLSI implementation

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; LOGIC DESIGN; LOGIC GATES; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING; VLSI CIRCUITS;

ARITHMETIC CIRCUITS; CHINESE REMAINDER THEOREM; GALOIS FIELD ARITHMETIC; ISOMORPHIC COPY;

COMPUTER CIRCUITS;

EID: 0036933796     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2002.1146713     Document Type: Note

References (8)

1. m) Yielding Small Complexity Arithmetic Circuits," IEEE Trans. Computers, vol. 47, no. 9, pp. 938-946, Sept. 1998.
2. m)," Information and Computation, vol. 83, no. 1, pp. 21-40, 1989.
3. m) for Certain Values of m," Discrete Math., vols. 106/107, pp. 497-502, 1992.
4. N)," Proc. Cryptographic Hardware and Embedded Systems, First Int'l Workshop (CHES '99), ÇK. Koç and C. Paar, eds., pp. 122-134, 1999.
5. H. Wu, M.A. Hasan, and I.F. Blake, "Highly Regular Architectures for Finite Field Computation Using Redundant Basis," Proc. Cryptographic Hardware and Embedded Systems, First Int'l Workshop (CHES '99), ÇK. Koç and C. Paar, eds., pp. 269-279, 1999.
6. J.H. Silverman, "Rings of Low Multiplicative Complexity," Finite Fields and Their Applications, vol. 6, no. 2, pp. 175-191, 2000.
7. W. Geiselmann and H. Lukhaub, "Redundant Representation of Finite Fields," Proc. Public Key Cryptography, Fourth Int'l Workshop Practice and Theory in Public Key Cryptosystems (PKC 2001), K. Kim, ed. pp. 339-352, 2001.
8. W. Bosma, J. Cannon, and C. Playoust, "The Magma Algebra System I: The User Language," J. Symbolic Computation, vol. 24, pp. 235-265, 1997.