Constructing Composite Field Representations for Efficient Conversion

IEEE Transactions on Computers

Volumn 52, Issue 11, 2003, Pages 1391-1398

  Sunar, Berk ^a   Savas, Erkay ^b   Koç, Çetin K ^c  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

^b SABANCI UNIVERSITY   (Turkey)

^c Oregon State University   (United States)

Author keywords

AES; Change of basis; Composite and binary fields; Primitive element

Indexed keywords

ALGORITHMS; CODE CONVERTERS; COMPUTATIONAL METHODS; CRYPTOGRAPHY; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

COMPOSITE FIELDS;

BINARY CODES;

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

References (20)

1. J.V. Brawley and G.E. Schnibben, Infinite Algebraic Extensions of Finite Fields. Providence, R.I.: Am. Math. Soc., 1989.
2. B.S. Kaliski Jr. and M. Liskov, "Efficient Finite Field Basis Conversion Involving Dual Bases," Cryptographic Hardware and Embedded Systems, C.K. Koç and C. Paar, eds., pp. 135-143, Berlin: Springer-Verlag, 1999.
3. B.S. Kaliski Jr. and Y.L. Yin, "Methods and Apparatuses for Efficient Finite Field Conversion," US Patent Number 5,854,759, 29 Dec. 1998.
4. B.S. Kaliski Jr. and Y.L. Yin, "Storage-Efficient Finite Field Basis Conversion," Selected Areas in Cryptography, S. Tavares and H. Meijer, eds., pp. 81-93, Berlin: Springer-Verlag, 1998.
5. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. New York: Cambridge Univ. Press, 1994.
6. A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields. Boston: Kluwer Academic, 1993.
7. M. Jacobson, A.J. Menezes, and A. Stein, "Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent," CACR Technical Technical Report CORR2001-31, Univ. of Waterloo, May 2001.
8. IEEE Standard, "Specifications for Public Key Cryptography," IEEE P1363, 2000.
9. Standard, "Specifications for Public Key Cryptography: Additional Techniques," IEEE P1363a, working document, 2001.
10. C. Paar, "Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields," PhD thesis, Universität GH Essen, VDI Verlag, 1994.
11. C. Paar, P. Fleishmann, and P. Soria-Rodriguez, "Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents," IEEE Trans. Computers, vol. 48, no. 10, pp. 1025-1034, Oct. 1999.
12. A. Rudra, P.K. Dubey, C.S. Jutla, V. Kumar, J.R. Rao, and P. Rohatgi, "Efficient Rijndael Encryption Implementation with Composite Field Arithmetic," Cryptographic Hardware and Embedded Systems, Ç.K. Koç, D. Naccache, and C. Paar, eds., pp. 171-184, Berlin: Springer-Verlag, 2001.
13. R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck, "Fast Key Exchange with Elliptic Curve Systems," Advances in Cryptology - CRYPTO 95, D. Coppersmith, ed., pp. 43-56, Berlin: Springer-Verlag, 1995.
14. N)," Cryptographic Hardware and Embedded Systems, Ç.K. Koç and C. Paar, eds., pp. 122-134, Berlin: Springer-Verlag, 1999.
15. n)," Advances in Cryptology - ASIACRYPT '96, K. Kim and T. Matsumoto, eds., pp. 65-76, Berlin: Springer-Verlag, 1996.
16. H. Wu, "Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis," Cryptographic Hardware and Embedded Systems, Ç.K. Koç and C. Paar, eds., pp. 280-291, Berlin: Springer-Verlag, 1999.
17. H. Wu, M.A. Hasan, and I.F. Blake, "Highly Regular Architectures for Finite Field Computation Using Redundant Basis," Cryptographic Hardware and Embedded Systems, Ç.K. Koç and C. Paar, eds., pp. 269-279, Berlin: Springer-Verlag, 1999.
18. A. Reyhani-Masoleh and M.A. Hasan, "On Efficient Normal Basis Multiplication," Proc. Indocrypt 2000, pp. 213-224, 2000.
19. S. Oh, C H. Kim, J. Lim, and D.H. Cheon, "Efficient Normal Basis Multipliers in Composite Fields," IEEE Trans. Computers, vol. 49, no. 10, pp. 1133-1138, Oct. 2000.
20. American Bankers Assoc, "X9.62 American National Standards Institute Standard, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA)," Jan. 1999.