Efficient hardware implementation of finite fields with applications to cryptography

Acta Applicandae Mathematicae

Volumn 93, Issue 1-3, 2006, Pages 75-118

  Guajardo, Jorge ^a   Güneysu, Tim ^b   Kumar, Sandeep S ^b   Paar, Christof ^b   Pelzl, Jan ^b  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Binary field arithmetic; Cryptography; Efficient implementation; Extension field arithmetic; Field arithmetic; Optimal extension fields; Prime field arithmetic

Indexed keywords

BINARY FIELD ARITHMETIC; EFFICIENT IMPLEMENTATION; EXTENSION FIELD ARITHMETIC; FIELD ARITHMETIC; OPTIMAL EXTENSION FIELDS; PRIME FIELD ARITHMETIC;

ALGORITHMS; BINARY SEQUENCES; CRYPTOGRAPHY; FINITE ELEMENT METHOD;

DIGITAL ARITHMETIC;

EID: 33749536430     PISSN: 01678019     EISSN: 15729036     Source Type: Journal    
DOI: 10.1007/s10440-006-9072-z     Document Type: Article

References (80)

1. Actel Corporation: Adel's ProASIC family, the only ASIC design flow FPGA. (2001)
2. Altera Corporation: APEX 20KC programmable logic device data sheet. (2001)
3. Amanor, D.N., Paar, C., Pelzl, J., Bunimov, V., Schimmler, M.: Efficient hardware architectures for modular multiplication on FPGAs. In: 2005 International Conference on Field Programmable Logic and Applications (FPL), Tampere, Finland, pp. 539-542. IEEE Circuits and Systems Society, Piscataway, New Jersey, August 2005
4. Barrett, P.: Implementing the Rivest, Shamir and Adleman public-key encryption algorithm on standard digital signal processor. In: Odlyzko, A.M. (ed.) Advances in Cryptology-CRYPTO'86. LNCS, vol. 263, pp. 311-323. Springer, Berlin Heidelberg New York (1987)
5. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) Advances in Cryptology - CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Berlin Heidelberg New York (2001)
6. m) arithmetic architectures for cryptographic applications. In: Joye, M. (ed.) Topics in Cryptology -CT-RSA 2003. LNCS, vol. 2612, pp. 158-175. Springer, Berlin Heidelberg New York (2003)
7. Blake, I.F., Gao, S., Lambert, R.J.: Constructive problems for irreducible polynomials over finite fields. In: Gulliver, T.A., Secord, N.P. (eds.) Information Theory and Applications. LNCS, vol. 793, pp. 1-23. Springer, Berlin Heidelberg New York (1993)
8. m). In: Johansson, T., Maitra, S. (eds.) Progress in Cryptology - IN-DOCRYPT 2003. LNCS, vol. 2904, pp. 349-362. Springer, Berlin Heidelberg New York (2003)
9. k) for elliptic curve cryptography. In: Bajard, J.-C., Schulte, M. (eds.) Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16), pp. 181-187. Santiago de Compostela, Spain, 15-18 June 2003
10. Bucek, J., Lorencz, R.: Comparing subtraction-free and traditional AMI. In: Proceedings of the 9th IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS 2006), Prague, Czech Republic, 18-21 April 2006. pp. 97-99. IEEE Computer Society, Los Alamitos, CA, USA (2006)
11. Blakley, G.R.: A computer algorithm for calculating the product A · B modulo M. IEEE Trans. Comput. C-32(5), 497-500 (1983)
12. Batina, L., Ors, S.B., Preneel, B., Vandewalle, J.: Hardware architectures for public key cryptography. Integration, VLSI J. 34(6), 1-64 (2003)
13. Bailey, D.V., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorithms. In: Krawczyk, H. (ed.) Advances in Cryptology - CRYPTO '98. LNCS, vol. 1462, pp. 472-485. Springer, Berlin Heidelberg New York (1998)
14. Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J. Cryptology 14(3), 153-176 (2001)
15. Bunimov, V., Schimmler, M.: Area and time efficient modular multiplication of large integers. In: IEEE 14th International Conference on Application-specific Systems, Architectures and Processors, The Hague, The Netherlands, June 2003
16. Bunimov, V., Schimmler, M., Tolg, B.: A complexity-effective version of montgomery's algorithm. In: Workshop on Complexity Effective Designs, ISCA'02, Anchorage, Alaska, May 2002
17. Di Claudio, E.D., Piazza, F., Orlandi, G.: Fast combinatorial RNS processors for DSP applications. IEEE Trans. Comput. 44(5), 624-633 (1995)
18. m) on CalmRISC with MAC2424 coprocessor. In: Koç, Ç.K., Paar, C. (eds.) Workshop on Cryptographic Hardware and Embedded Systems - CHES, 17-18 August 2000. LNCS, vol. 1965, pp. 57-70. Springer, Berlin Heidelberg New York (2000)
19. n). In: Kim, K., Matsumoto, T. (eds.) Advances in Cryptology - ASIACRYFI '96. Lecture Notes in Computer Science, vol. 1163, pp. 65-76. Springer, Berlin Heidelberg New York (November 1996)
20. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inform. Theory IT22(6), 644-654 (1976)
21. Diffie, W.: Subject: Authenticity of non-secret encryption documents. Available at http://cryptome.org/ukpk-diffie.htm. October 6, 1999 (Email message sent to John Young)
22. Daly, A., Marnane, L., Popovici, E.: Fast modular inversion in the montgomery domain on reconfigurable logic. Technical report, University College Cork, Ireland (2003)
23. Ellis, J.H.: The story of non-secret encryption. Available at http://jya.com/ellisdoc.htm (December 16, 1997)
24. Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D. (eds.) Algorithmic Number Theory - ANTS-V, LNCS, vol. 2369, pp. 324-337. Springer, Berlin Heidelberg New York (2002)
25. Golomb, S.W.: Shift Register Sequences. Holden-Day, San Francisco, USA (1967)
26. Guajardo, J., Paar, C.: Efficient algorithms for elliptic curve cryptosystems. In: Kaliski Jr., B. (ed.) Advances in Cryptology - CRYPTO '97, Lecture Notes in Computer Science, vol. 1294, pp. 342-356. Springer, Berlin Heidelberg New York (August 1997)
27. Guajardo, J., Paar, C.: Itoh-Tsujii inversion in standard basis and its application in cryptography and codes. Des. Codes Cryptogr. 25(2), 207-216 (2002)
28. n) for designing arithmetic circuits. IEEE Trans. Comput. 52(7), 848-853 (2003)
29. Gutub, A.A., Tenca, A.F., Koc, C.K.: Scalable VLSI architecture for GF(p) Montgomery modular inverse computation. In: Naccache, D. (ed.) IEEE Computer Society Annual Symposium on VLSI, pp. 53-58. IEEE Computer Society Press, Los Alamitos, California (2002)
30. m) with cryptographic applications. PhD thesis, Ruhr-Universität Bochum, Germany (Available at http://www.crypto.rub.de/ theses.html) (July 2004)
31. m) multipliers. In: Proceedings of the 45th IEEE International Midwest Symposium on Circuits and Systems - MWSCAS 2002, Tulsa, Oklahoma, August 2002
32. m) using normal bases. Comput. Inf. 78, 171-177 (1988)
33. Jullien, G.A.: Residue number scaling and other operations using ROM arrays. IEEE Trans. Comput. C-27, 325-337 (1978)
34. Kaliski, B.S.: The montgomery inverse and its applications. IEEE Trans. Comput. 44(8), 1064-1065 (1995)
35. Koç, Ç.K., Hung, C.Y.: Bit-level systolic arrays for modular multiplication. J. VLSI Signal Process. 3(3), 215-223 (1991)
36. Knuth, D.E.: The Art of Computer Programming, Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading, Massachusetts (November 1971)(2nd printing)
37. Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, vol. 2, 2nd edn. Addison-Wesley, Massachusetts, USA (1973)
38. Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. 7, 595-596 (1963) (English translation)
39. Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203-209 (1987)
40. Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptology 1(3), 129-150 (1989)
41. Koblitz, N.: An elliptic curve implementation of the finite field digital signature algorithm. In: Krawczyk, H. (ed.) Advances in Cryptology - CRYPTO 98. LNCS, vol. 1462, pp. 327-337. Springer, Berlin Heidelberg New York (1998)
42. Koren, I.: Computer Arithmetic Architectures. Prentice-Hall, New Jersey (1993)
43. Lidl, R., Niederreiter, H.: Finite fields. In: Encyclopedia of Mathematics and its Applications, vol. 20, 2nd edn. Cambridge University Press, Great Britain (1997)
44. 3. Rapport de recherche no. 3918, INRIA (April 2000)
45. Lenstra, A., Verheul, E.: The XTR public-key cryptosystem. In: Bellare, M. (ed.) Advances in Cryptology - CRYPTO 2000. LNCS, vol. 1423, pp. 1-19. Springer, Berlin Heidelberg New York (2000)
46. Mihǎilescu, P.: Optimal Galois Field Bases which are not Normal. Recent Results Session - FSE '97 (1997)
47. Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) Advances in cryptology - CRYPTO '85. Lecture Notes in Computer Science, vol. 218, pp. 417-426. Springer, Berlin Heidelberg New York (August 1986)
48. Morii, M., Kasahara, M., Whiting, D.L.: Efficient bit-serial multiplication and discrete-time Wiener-Hoph equation over finite fields. IEEE Trans. Inform. Theory, IT-35, 1177-1184 (1989)
49. Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519-521 (1985)
50. Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519-521 (1985)
51. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. The CRC Press Series on Discrete Mathematics and Its Applications. CRC, Florida, USA (1997)
52. National Institute for Standards and Technology: FIPS 186-2: Digital Signature Standard (DSS)186-2. Gaithersburg, Maryland, USA (Available for download at http://csrc.nist.gov/encryption) (February 2000)
53. Norris, M.J., Simmons, G.J.: Algorithms for high-speed modular arithmetic. Congressus Numeratium 31, 153-163 (1981)
54. 3). In: Proceedings of the IEEE Region 10 Conference -TENCON 99. Multimedia Technology for Asia-Pacific Information Infrastructure, vol. 1, pp. 383-386, Cheju, Korea (1999)
55. Parhami, B.: Computer Arithemtic - Algorithms and Hardware Designs. Oxford University Press, New York, USA (1999)
56. m) multiplication using polynomial residue number systems. IEEE Trans. Circuits Syst., 2 Analog Digit. Signal Process. 42(11), 718-721 (1995)
57. Paliouras, V., Karagianni, K., Stouraitis, T.: A low-complexity combinatorial RNS multiplier. IEEE Trans. Circuits Systems I Fund., 2 Analog Digit. Signal Process. 48(7), 675-683 (2001)
58. Smith, P., Skinner, C.: A public-key cryptosystem and a digital signature system based on the lucas function analogue to discrete logarithms. In: Pieprzyk, J., Safavi-Naini, R. (eds.) Advances in Cryptology - ASIACRYPT94. LNCS, vol. 917, pp. 357-364. Springer, Berlin Heidelberg New York(1995)
59. Page, D., Smart, N.P.: Hardware implementation of finite fields of characteristic three. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) Workshop on Cryptographic Hardware and Embedded Systems - CHES 2002. LNCS, vol. 2523, pp. 529-539. Springer, Berlin Heidelberg New York (2002)
60. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120-126 (1978)
61. Radhakrishnan, D., Yuan, Y.: Novel approaches to the design of VLSI RNS multipliers. IEEE Trans. Circuits Syst., 2 Analog Digit. Signal Process. 39(1), 52-57 (1992)
62. Schneier, B.: Crypto-Gram newsletter, (available at http://www.schneier. com/cryplo-gram-9805.html) May 15, 1998
63. Sloan, K.R.: Comments on a computer algorithm for calculating the product A · B modulo M. IEEE Trans. Comput. C-34(3), 290-292 (1985)
64. Smart, N.: Elliptic curve cryptosystems over small fields of odd characteristic. J. Cryptology. 12(2), 141-151 (1999)
65. Song, L., Parhi, K.K.: Low energy digit-serial/parallel finite field multipliers. J. VLSI Signal Process. 19(2), 149-166 (1998)
66. Soudris, D.J., Paliouras, V., Stouraitis, T., Goutis, C.E.: A VLSI design methodology for RNS full adder-based inner product architectures. IEEE Trans. Circuits Syst., 2 Analog Digit. Signal Process. 44(4), 315-318 (1997)
67. Szabó, N., Tanaka, R.: Residue Arithmetic and its Applications to Computer Technology. McGraw-Hill, New York (1967)
68. Skavantzos, A., Taylor, F.J.: On the polynomial residue number system. IEEE Trans. Signal Process. 39, 376-382 (1991)
69. Takagi, N.: A VLSI algorithm for modular division based on the binary GCD algorithm. In: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, vol. E81-A, pp. 724-728 (1998)
70. Tenca, A.F., Koç, Ç.K.: A scalable architecture for montgomery multiplication. In: Koç, Ç.K., Paar, C. (eds.) Workshop on Cryptographic Hardware and Embedded Systems - CHES'99. LNCS, vol. 1717 pp. 94-108. Springer, Berlin Heidelberg New York 12-13 August 1999
71. Tawalbeh, L.A., Tenca, A.F., Park, S., Koc, C.K.: A dual-field modular division algorithm and architecture for application specific hardware. In: Thirty-Eighth Asilomar Conference on Signals, Systems, and Computers, vol. 1, pp. 483-487. Pacific Grove, California (2004)
72. von zur Gathen, J.: Irreducible trinomials over finite fields. In: Mourrain, B. (ed.) Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation - ISSAC2001, pp. 332-336. ACM, New York (2001)
73. von zur Gathen, J., Nöcker, M.: Exponentiation in finite fields: theory and practice. In: Mora, T., Mattson, H. (eds.) Applied Algebra, Agebraic Algorithms and Error Correcting Codes - AAECC-12. LNCS, vol. 1255, pp. 88-113. Springer, Berlin Heidelberg New York (2000)
74. Walter, CD.: Logarithmic speed modular multiplication. Electron. Lett. 30(17), 1397-1398 (1994)
75. Wang, M., Blake, I.F.: Bit serial multiplication in finite fields. SIAM J. Discrete Math. 3(1), 140-148 (1990)
76. q. IEEE Trans. Circuits Systems 1, Fund. Theory Appl. 49(7), 1009-10.13 (2002)
77. Xilinx, Inc.: The Programmable Logic Data Book (2000)
78. Zierler, N., Brillhart, J.: On primitive trinomials (mod2). Inf. Control 13, 541-554 (1968)
79. Zierler, N., Brillhart, J.: On primitive trinomials (mod2), II. Inf. Control 14, 566-569 (1969)
80. n + x + 1 over GF(2). Inf. Control 16, 67-69 (1970)