Efficient multiplication using type 2 optimal normal bases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4547 LNCS, Issue , 2007, Pages 55-68

  Von Zur Gathen, Joachim ^a   Shokrollahi, Amin ^b   Shokrollahi, Jamshid ^a,c  

^a UNIVERSITY OF BONN   (Germany)

^b Station 14 ^*  (Switzerland)

^c RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Asymptotically fast algorithms; Finite field arithmetic; Optimal normal bases

Indexed keywords

ALGORITHMS; ASYMPTOTIC ANALYSIS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; POLYNOMIALS;

ASYMPTOTICALLY FAST ALGORITHMS; FINITE FIELD ARITHMETIC; OPTIMAL NORMAL BASES;

OPTIMAL SYSTEMS;

EID: 38149111947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73074-3_6     Document Type: Conference Paper

References (19)

1. U.S. Department of Commerce / National Institute of Standards and Technology: Digital Signature Standard (DSS) Federal Information Processings Standards Publication 186-2 (2000)
2. Fan, H., Hasan, M.A.: Subquadratic multiplication using optimal normal bases. Technical Report cacr2006-26, University of Waterloo, Waterloo (2006)
3. Gao, S., von zur Gathen, J., Panario, D., Shoup, V.: Algorithms for exponentiation in finite fields. Journal of Symbolic Computation 29, 879-889 (2000)
4. Gao von, S., von zur Gathen, J., Panario, D.: Gauss periods and fast exponentiation in finite fields. In: Baeza-Yates, R.A., Poblete, P.V., Goles, E. (eds.) LATIN 1995. LNCS, vol. 911, pp. 311-322. Springer, Heidelberg (1995)
5. Gao, S., Lenstra Jr., H.W.: Optimal normal bases. Designs, Codes, and Cryptography 2, 315-323 (1992)
6. von zur Gathen, J., Nöcker, M.: Polynomial and normal bases for finite fields. Journal of Cryptology 18, 313-335 (2005)
7. 2. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 359-369. Springer, Heidelberg (2006)
8. 233) multipliers. In: Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS-03), Bangkok, Thailand, vol. II, pp. 268-271 (2003)
9. Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing-based cryptogaphy in characteristic three. IEEE Transactions on Computers 54, 852-860 (2005)
10. Kaliski, B.S., Liskov, M.: Efficient Finite Field Basis Conversion Involving Dual Bases. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 135-143. Springer, Heidelberg (1999)
11. van Loan, C.: Computational Frameworks for the Fast Fourier Transform. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1992)
12. n). Discrete Applied Mathematics 22, 149-161 (1989)
13. Nöcker, M.: Data structures for parallel exponentiation in finite fields. Doktorarbeit, Universität Paderborn, Germany (2001)
14. Omura, J.K., Massey, J.L.: Computational method and apparatus for finite field arithmetic. United States Patent vol. 4, pp. 587,627 (1986) (Date of Patent: May 6, 1986)
15. m). IEEE Transactions on Computers 51, 511-520 (2002)
16. Shokrollahi, J.: Efficient Implementation of Elliptic Curve Cryptography on FPGAs. PhD thesis, Bonn University, Bonn (2006) http://hss.ulb.uni-bonn.de/ diss_online/math_nat_fak/2007/shokrollahi_jamshid/index.htm.
17. Sunar, B., Koç, Ç.K.: An efficient optimal normal basis type II multiplier. IEEE Transactions on Computers 50, 83-87 (2001)
18. Wassermann, A.: Konstruktion von Normalbasen. Bayreuther Math. Schriften 31, 155-164 (1990)
19. Wikipedia: Sierpinski triangle. (2006), Webpage http://en.wikipedia.org/ wiki/Sierpinski_triangle