A redundant representation of GF(qn) for designing arithmetic circuits

IEEE Transactions on Computers

Volumn 52, Issue 7, 2003, Pages 848-854

  Geiselmann, Willi ^a   Steinwandt, Rainer ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Galois field arithmetic; VLSI implementation

Indexed keywords

CALCULATIONS; INTEGRATED CIRCUIT MANUFACTURE; MULTIPLYING CIRCUITS; POLYNOMIALS; SHIFT REGISTERS; THEOREM PROVING; VLSI CIRCUITS;

GALOIS FIELD ARITHMETIC; HOMOMORPHISM;

DIGITAL ARITHMETIC;

EID: 0042349550     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1214334     Document Type: Article

References (16)

1. N)," Cryptographic Hardware and Embedded Systems, Proc. First Int'l Workshop, CHES '99, ÇK. Koç and C. Paar, eds. pp. 122-134, 1999.
2. m) Yielding Small Complexity Arithmetic Circuits," IEEE Trans. Computers, vol. 47, no. 9, pp. 938-946, Sept. 1998.
3. m)," Information and Computation, vol. 83, no. 1, pp. 21-40, 1989.
4. J.H. Silverman, "Rings of Low Multiplicative Complexity," Finite Fields and Their Applications, vol. 6, no. 2, pp. 175-191, 2000.
5. m) for Certain Values of m," Discrete Math., vols. 106/107, pp. 497-502, 1992.
6. H. Wu, M.A. Hasan, and I.F. Blake, "Highly Regular Architectures for Finite Field Computation Using Redundant Basis," Cryptographic Hardware and Embedded Systems, Proc. First Int'l Workshop, CHES '99, ÇK. Koç and C. Paar, eds., pp. 269-279, 1999.
7. m) Yielding Small Complexity Arithmetic Circuits'," IEEE Trans. Computers, vol. 51, no. 12, pp. 1460-1461, Dec. 2002.
8. W. Geiselmann and H. Lukhaub, "Redundant Representation of Finite Fields," Public Key Cryptography, Proc. Fourth Int'l Workshop Practice and Theory in Public Key Cryptosystems (PKC 2001), K. Kim, ed., pp. 339-352, 2001.
9. m)," 3. Kolloquium des Schwerpunktprogramms der Deutschen Forschungsgemeinschaft VIVA Grundlagen und Verfahren verlustarmer Informationsverarbeitung, D. Müller, C. Kretzschmar, and R. Siegmund, eds., pp. 98-104, 2002.
10. M. Ciet, J.-J. Quisquater, and F. Sica, "A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography," Proc. Progress in Cryptology-INDOCRYPT 2001, C.P. Rangan and C. Ding, eds., pp. 108-116, extended abstract, 2001.
11. P. Barreto and H. Kim, "Fast Hashing onto Elliptic Curves over Fields of Characteristic 3," Cryptology ePrint Archive: Report 2001/098, 2001, http://eprint.iacr.org/2001/098/.
12. D. Boneh, B. Lynn, and H. Shachman, "Short Signatures from the Weil Pairing," Advances in Cryptology-Proc. ASIACRYPT 2001, C. Boyd, ed., pp. 514-532, 2001.
13. N.P. Smart and E.J. Westwood, "Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three," Cryptology ePrint Archive, Report 2002/114, 2002, http://eprint.iacr.org/2002/114/.
14. D.V. Bailey and C. Paar, "Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography," J. Cryptology, vol. 14, pp. 153-176, 2001.
15. J. Guajardo and C. Paar, "Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes," Designs, Codes and Cryptography, vol. 25, no. 2, pp. 207-216, 2002.
16. W. Bosma, J. Cannon, and C. Plyoust, "The Magma Algebra System I: The User Language," J. Symbolic Computation, vol. 24, pp. 235-265, 1997.