Efficient GF(pm) arithmetic architectures for cryptographic applications

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

Volumn 2612, Issue , 2003, Pages 158-175

  Bertoni, Guido ^a   Guajardo, Jorge ^b   Kumar, Sandeep ^b   Orlando, Gerardo ^c   Paar, Christof ^b   Wollinger, Thomas ^b  

^a POLITECNICO DI MILANO   (Italy)

^b RUHR UNIVERSITY BOCHUM   (Germany)

^c GENERAL DYNAMICS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CRYPTOGRAPHIC APPLICATIONS; IRREDUCIBLE POLYNOMIALS; ONE-TIME; PERFORMANCE BASED; REDUCTION OPERATION;

ARCHITECTURE;

EID: 35248828050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_11     Document Type: Article

References (38)

1. Actel Corporation. Ariel's ProASIC Family, The Only ASIC Design Flow FPGA, 2001.
2. Altera Corporation. APEX 20KC Programmable Logic Device Data Sheet, 2001.
3. D. V. Bailey and C. Paar. Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In H. Krawczyk, editor, Advances in Cryptology - CRYPTO '98, volume LNCS 1462, pages 472-485, Berlin, Germany, 1998. Springer-Verlag.
4. D. V. Bailey and C. Paar. Efficient arithmetic in finite held extensions with application in elliptic curve cryptography. Journal of Cryptology, 14(3):153-176, 2001.
5. P. S. L. M. Barreto, H. Y. Kim, B. Lynn, and M. Scott. Efficient Algorithms for Pairing-Based Cryptosystems. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, volume LNCS 2442, pages 354-368. Springer-Verlag, 2002.
6. Blake, Gao, and Lambert. Constructive problems for irreducible polynomials over finite fields. In Information Theory and Applications, pages 1-23. Springer-Verlag, 1993.
7. D. Boneh, B.Lynn, and H. Shacham. Short signatures from the Weil pairing. In J. Boyd, editor, Advances in Cryptology - Asiacrypt 2001, volume LNCS 2148, pages 514-532. Springer-Verlag, 2001.
8. D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume LNCS 2139, pages 213-229. Springer-Verlag, 2001.
9. E. D. Di Claudio, F. Piazza, and G. Orlandi. Fast Combinatorial RNS Processors for DSP Applications. IEEE Transactions on Computers, 44(5):624-633, May 1995.
10. S. D. Galbraith, K. Harrison, and D. Soldera. Implementing the Tate Pairing. In C. Fieker and D. Kohel, editors, Algorithmic Number Theory - ANTS-V, volume LNCS 2369, pages 324-337. Springer-Verlag, 2002.
11. S.W. Golomb. Shift Register Sequences. Holden-Day, San Francisco, USA, 1967.
12. J. Guajardo and C. Paar. Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes. Design, Codes, and Cryptography, 25(2):207-216, February 2002.
13. J. Guajardo, T. Wollinger, and C. Paar. Area Efficient GF(p) Architectures for GF(pm) Multipliers. In Proceedings of the 45th IEEE International Midwest Symposium on Circuits and Systems - MWSCAS 2002, August 2002.
14. J. von zur Gathen. Irreducible Trinomials over Finite Fields. In B. Mourrain, editor, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation - ISSAC2001, pages 332-336. ACM Press, 2001.
15. J. von zur Gathen and M. Nöcker. Exponentiation in Finite Fields: Theory and Practice. In T. Mora and H. Mattson, editors, Applied Algebra, Agebraic Algorithms and Error Correcting Codes - AAECC-12, volume LNCS 1255, pages 88-113. Springer-Verlag, 2000.
16. S. K. Jain and K. K. Parhi. Efficient standard basis reed-solomon encoder. In 1996 IEEE International Conference of Acoustics, Speech, and Signal Processing, Atlanta, May 1996.
17. A. Joux. A one-round protocol for tripartite Diffie-Hellman. In W. Bosma, editor, Algorithmic Number Theory - ANTS-IV, volume LNCS 1838, pages 385-394. Springer-Verlag, 2000.
18. A. Karatsuba and Y. Ofman. Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. (English translation), 7(7):595-596, 1963.
19. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
20. N. Koblitz. Hyperelliptic cryptosystems. Journal of Cryptology, 1(3):129-150, 1989.
21. N. Koblitz. An elliptic curve implementation of the finite field digital signature algorithm. In H. Krawczyk, editor, Advances in Cryptology - CRYPTO 98, volume LNCS 1462, pages 327-337. Springer-Verlag, 1998.
22. R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications. Addison-Wesley, Reading, Massachusetts, USA, 1983.
23. 3. Rapport de recherche no. 3918, INRIA, April 2000.
24. V. Miller. Uses of elliptic curves in cryptography. In H. C. Williams, editor, Advances in Cryptology - CRYPTO '85, volume LNCS 218, pages 417-426, Berlin, Germany, 1986. Springer-Verlag.
25. 3). In Proceedings of the IEEE Region 10 Conference - TENCON 99. "Multimedia Technology for Asia-Pacific Information Infrastructure", volume 1, pages 383-386, 1999.
26. G. Orlando. Efficient Elliptic Curve Processor Architectures for Field Programmable Logic. PhD thesis, Dept. of ECE, Worcester Polytechnic Institute, March 2002.
27. m). In C. K. Koç and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2000, volume LNCS 1965, pages 41-56. Springer-Verlag, 2000.
28. P. Mihǎilescu. Optimal Galois Field Bases which are not Normal. Recent Results Session - FSE '97, 1997.
29. D. Page and N. P. Smart. Hardware implementation of finite fields of characteristic three. In B. S. Kaliski, Jr., Ç. K. Koç, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2002, volume LNCS. Springer-Verlag, 2002.
30. V. Paliouras, K. Karagianni, and T. Stouraitis. A Low-Complexity Combinatorial RNS Multiplier. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 48(7):675-683, July 2001.
31. m) Multiplication Using Polynomial Residue Number Systems. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 42(11):718-721, November 1995.
32. N. Smart. Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic. Journal of Cryptology, 12(2):141-151, Spring 1999.
33. L. Song and K. K. Parhi. Low energy digit-serial/parallel finite field multipliers. Journal of VLSI Signal Processing, 19(2):149-166, June 1998.
34. E. Verheul. Self-blindable Credential Certificates from the Weil Pairing. In C. Boyd, editor, Advances in Cryptology - Asiacrypt 2001, volume LNCS 2248, pages 533-551. Springer-Verlag, 2001.
35. Xilinx, Inc. The Programmable Logic Data Book, 2000.
36. n + x + 1 over GF(2). Information and Control, 16:67-69, 1970.
37. N. Zierler and J. Brillhart. On Primitive Trinomials (mod2). Information and Control, 13:541-554, 1968.
38. N. Zierler and J. Brillhart. On Primitive Trinomials (mod2), II. Information and Control, 14:566-569, 1969.