Optimal tower fields

IEEE Transactions on Computers

Volumn 53, Issue 10, 2004, Pages 1231-1243

  Baktir, Selçuk ^a   Sunar, Berk ^a  

^a WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Elliptic curve cryptography; Finite fields; Inversion; Multiplication; OEF; Optimal tower fields

Indexed keywords

ADDERS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; MULTIPLYING CIRCUITS; SUMMING CIRCUITS;

ELLIPTIC CURVE CRYPTOGRAPHY; FINITE FIELD OPERATIONS; OPTIMAL EXTENSION FIELDS; OPTIMAL TOWER FIELDS;

CRYPTOGRAPHY;

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

References (19)

1. A. Woodbury, D.V. Bailey, and C. Paar, "Elliptic Curve Cryptography on Smart Cards without Coprocessors," Proc. IFIP CARDIS 2000, Fourth Smart Card Research and Advanced Application Conf., Sept. 2000.
2. R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck, "Fast Key Exchange with Elliptic Curve Systems," Proc. Advances in Cryptology - CRYPTO '95, D. Coppersmith, ed., pp. 43-56, 1995.
3. k," Design, Codes, and Cryptography, vol. 14, no. 1, pp. 57-69, 1998.
4. I.S. Hsu, T.K. Truong, L.J. Deutsch, and I.S. Reed, "A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual-, Normal-, or Standard Bases," IEEE Trans. Computers, vol. 37, no. 6, pp. 735-739, June 1988.
5. m) Using Normal Bases," Information and Computation, vol. 78, pp. 171-177, 1988.
6. B. Sunar, "Fast Galois Field Arithmetic for Elliptic Curve Cryptography and Error Control Codes," PhD thesis, Dept. of Electrical & Computer Eng., Oregon State Univ., Corvallis, Nov. 1998.
7. qn", Designs, Codes, and Cryptography, vol. 3, pp. 333-345, 1993.
8. S.T.J. Fenn, M. Benaissa, and D. Taylor, "Finite Field Inversion over the Dual Base," IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 4, pp. 134-136, Mar. 1996.
9. m," IEEE Trans. Computers, vol. 47, no. 9, pp. 960-970, Sept. 1998.
10. D.V. Bailey and C. Paar, "Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography," J. Cryptology, vol. 14, no. 3, pp. 153-176, 2001.
11. D.V. Bailey and C. Paar, "Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms," Proc. Advances in Cryptology - CRYPTO '98 H. Krawczyk, ed., pp. 472-485, 1998.
12. R. Lidl and H. Niederreiter, Finite Fields, vol. 20 of Encyclopedia of Math. and Its Applications. Reading, Mass.: Addison-Wesley, 1983.
13. J. Guajardo and C. Paar, "Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography," Design, Codes, and Cryptography no. 25, pp. 207-216, 2002.
14. G.I. Davida, "Inverse of Elements of a Galois Field," Electronic Letters, vol. 8, pp. 518-520, Oct. 1972.
15. m)," Trans. IEICE, vol. E 72, pp. 37-42, Jan. 1989.
16. A. Karatsuba and Y. Ofman, "Multiplication of Multidigit Numbers on Automata," Sov. Phys. Dokl. (English translation), vol. 7, no. 7, pp. 595-596, 1963.
17. P. Gaudry, F. Hess, and N.P. Smart, "Constructive and Destructive Facets of Weil Descent on Elliptic Curves," J. Cryptology, vol. 15, pp. 19-46, 2002.
18. N. P. Smart, "How Secure Are Elliptic Curves over Composite Extension Fields?" Technical Report CSTR-00-017, Dept. of Computer Science, Univ. of Bristol, Nov. 2000.
19. N.P. Smart, "A Comparison of Different Finite Fields for Use in Elliptic Curve Cryptosystems," Technical Report CSTR-00-007, Dept. of Computer Science, Univ. of Bristol, June 2000.