Finite field arithmetic for cryptography

IEEE Circuits and Systems Magazine

Volumn 10, Issue 2, 2010, Pages 40-56

  Savaş, Erkay ^a   Koç, Çetin Kaya ^b,c  

^a SABANCI UNIVERSITY   (Turkey)

^b ISTANBUL SEHIR UNIVERSITY   (Turkey)

^c University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION AREA; CRYPTOGRAPHIC ALGORITHMS; CRYPTOGRAPHIC OPERATIONS; CURRENT TRENDS; DESIGN PRACTICE; DESIGN SPACES; ELLIPTIC CURVE; EXECUTION SPEED; FINITE FIELD ARITHMETIC; INTERDISCIPLINARY RESEARCH; PAIRING-BASED CRYPTOGRAPHY; PUBLIC KEYS;

ALGORITHMS;

CRYPTOGRAPHY;

EID: 77952962466     PISSN: 1531636X     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCAS.2010.936785     Document Type: Article

References (57)

1. A. Avizienis, "Signed-digit number representations for fast parallel arithmetic," IRE Trans. Electron. Comput., vol. EC, no. 10, pp. 389-400, Sept. 1961.
2. D. Boneh, R. A. Demillo, and R. J. Lipton, "On the importance of eliminating errors in cryptographic computations," J. Cryptology, vol. 14, pp. 101-119, 2001.
3. D. Boneh and M. K. Franklin, "Identity-based encryption from the Weil pairing," in CRYPTO (LNCS, vol. 2139), J. Kilian, Ed. New York: Springer-Verlag, 2001, pp. 213-229.
4. D. Boneh, X. Boyen, and H. Shacham, "Short group signatures," in CRYPTO (LNCS, vol. 3152), M. K. Franklin, Ed. New York: Springer-Ver-lag, 2004, pp. 41-55.
5. D. Boneh and M. K. Franklin, "Identity-based encryption from the Weil pairing," in CRYPTO (LNCS, vol. 2139), J. Kilian, Ed. New York: Springer-Verlag, 2001, pp. 213-229.
6. E. F. Brickell, J. Camenisch, and L. Chen, "Direct anonymous attestation," in Proc. ACM Conf. Computer and Communications Security, V. Atluri, B. Pfitzmann, and P. D. McDaniel, Eds. ACM, 2004, pp. 132-145.
7. E. Brickell, L. Chen, and J. Li, "A new direct anonymous attestation scheme from bilinear maps," in TRUST (LNCS, vol. 4968), P. Lipp, A.-R. Sa-deghi, and K.-M. Koch, Eds. New York: Springer-Verlag, 2008, pp. 166-178.
8. L. Chen, P. Morrissey, and N. Smart. (2009). DAA: Fixing the pairing based protocols. Cryptology ePrint Archive, Rep. 2009/198 [Online]. Available: http://eprint.iacr.org/
9. L. Chen, P. Morrissey, and N. P. Smart, "Pairings in trusted computing," in Pairing (LNCS, vol. 5209), S. D. Galbraith and K. G. Paterson, Eds. New York: Springer-Verlag, 2008, pp. 1-17.
10. S. S. M. Chow, L. C. K. Hui, and S.-M. Yiu, "Identity based threshold ring signature," in ICISC (LNCS, vol. 3506), C. Park and S. Chee, Eds. New York: Springer-Verlag, 2004, pp. 218-232.
11. H. Cohen, A. Miyaji, and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates," in ASIACRYPT (LNCS, vol. 1514), K. Ohta and D. Pei, Eds. New York: Springer-Verlag, 1998, pp. 51-65.
12. A. J. Devegili, C. Higeartaigh, and M. Scott. (2006). Multiplication and squaring on pairing-friendly fields. Cryptology ePrint Archive, Rep. 2006/471 [Online]. Available: http://eprint.iacr.org/
13. W. Diffie and M. E. Hellman, "New directions in cryptography," IEEE Trans. Inform. Theory, vol. 22, pp. 644-654, Nov. 1976.
14. S. E. Eldridge, "An faster modular multiplication algorithm," Int. J. Comput. Math., vol. 40, no. 1, pp. 63-68, 1991.
15. C. Giraud, "An RSA implementation resistant to fault attacks and to simple power analysis," IEEE Trans. Comput., vol. 55, no. 9, pp. 1116-1120, 2006.
16. k)," in CHES (LNCS, vol. 2523), B. S. Kaliski, Jr., Ç. K. Koç, and C. Paar, Eds. New York: Springer-Verlag, 2002, pp. 484-499.
17. G. Hachez and J.-J. Quisquater, "Montgomery exponentiation with no final subtractions: Improved results," in CHES (LNCS, vol. 1965), Ç. K. Koç and C. Paar, Eds. New York: Springer-Verlag, 2000, pp. 293-301.
18. Standard Specifications for Public-Key Cryptography, IEEE P1363, 2000.
19. A. Joux, "A one round protocol for tripartite Diffie-Hellman," in ANTS (LNCS, vol. 1838), W. Bosma, Ed. New York: Springer-Verlag, 2000, pp. 385-394.
20. M. Joye, "Highly regular right-to-left algorithms for scalar multiplication," in CHES (LNCS, vol. 4727). New York: Springer-Verlag, 2007, pp. 135-147.
21. M. Joye, "Highly regular m-ary powering ladders," in Selected Areas in Cryptography (LNCS, vol. 5867), M. J. J. Jr., V. Rijmen, and R. Safavi-Naini, Eds. New York: Springer-Verlag, 2009, pp. 350-363.
22. M. Joye and S.-M. Yen, "The Montgomery powering ladder," in CHES (LNCS, vol. 2523), B. S. Kaliski, Jr., Ç. K. Koç, and C. Paar, Eds. New York: Springer-Verlag, 2002, pp. 291-302.
23. B. S. Kaliski, Jr., "The Montgomery inverse and its applications," IEEE Trans. Comput., vol. 44, no. 8, pp. 1064-1065, Aug. 1995.
24. B. S. Kaliski, Jr., Ç. K. Koç, and C. Paar, Eds., "Cryptographic hardware and embedded systems-CHES 2002," in Proc. 4th Int. Workshop (LNCS, vol. 2523), Redwood Shores, CA, Aug. 13-15, 2002. New York: Springer-Verlag, 2003.
25. D. Karakoyunlu, F. K. Gurkaynak, B. Sunar, and Y. Leblebici, "Efficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields," IET Inform. Security, vol. 4, no. 1, pp. 30-43, 2010.
26. J. Kilian, Ed., Advances in Cryptology-CRYPTO 2001 (LNCS, vol. 2139). New York: Springer-Verlag, 2001.
27. N. Koblitz, "Elliptic curve cryptosystems," Math. Comput., vol. 48, no. 177, pp. 203-209, Jan. 1987.
28. k2," Des., Codes Cryptogr., vol. 14, no. 1, pp. 57-69, Apr. 1998.
29. Ç. K. Koç, T. Acar, and B. S. Kaliski, Jr., "Analyzing and comparing Montgomery multiplication algorithms," IEEE Micro, vol. 16, no. 3, pp. 26-33, June 1996.
30. P. C. Kocher, "Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems," in CRYPTO (LNCS, vol. 1109), N. Koblitz, Ed. New York: Springer-Verlag, 1996, pp. 104-113.
31. P. C. Kocher, J. Jaffe, and B. Jun, "Differential power analysis," in CRYPTO (LNCS, vol. 1666), M. J. Wiener, Ed. New York: Springer-Verlag, 1999, pp. 388-397.
32. G. Kömürcü and E. Savaş, "An efficient hardware implementation of the Tate pairing in characteristic three," in ICONS. IEEE Computer Society, 2008, pp. 23-28.
33. A. J. Menezes, Elliptic Curve Public Key Cryptosystems. Norwell, MA: Kluwer, 1993.
34. V. S. Miller, "Use of elliptic curves in cryptography," in CRYPTO (LNCS, vol. 218), H. C. Williams, Ed. New York: Springer-Verlag, 1985, pp. 417-426.
35. P. L. Montgomery, "Modular multiplication without trial division," Math. Comput., vol. 44, no. 170, pp. 519-521, Apr. 1985.
36. National Institute for Standards and Technology, "Digital signature standard (DSS)," Fed. Reg., vol. 56, p. 169, Aug. 1991.
37. J.-H. Oh and S.-J. Moon, "Modular multiplication method," IEE Proc. Comput. Digital Tech., vol. 145, no. 4, pp. 317-318, July 1998.
38. E. Öksüzoglu and E. Savaş, "Parametric, secure and compact implementation of RSA on FPGA," in RECONFIG '08: Proc. 2008 Int. Conf. Reconfigurable Computing and FPGAs. Washington, DC: IEEE Computer Society, 2008, pp. 391-396.
39. E. Öztürk, B. Sunar, and E. Savaş, "A versatile Montgomery multiplier architecture with characteristic three support," Comput. Electr. Eng., vol. 35, no. 1, pp. 71-85, 2009.
40. E. Öztürk, B. Sunar, and E. Savaş, "Low-power elliptic curve cryptography using scaled modular arithmetic," in CHES (LNCS, vol. 3156), M. Joye and J.-J. Quisquater, Eds. New York: Springer-Verlag, 2004, pp. 92-106.
41. R. L. Rivest, A. Shamir, and L. M. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Commun. ACM, vol. 21, no. 2, pp. 120-126, 1978.
42. R. Sakai, K. Ohgishi, and M. Kasahara, "Cryptosystems based on pairing," in Proc. Symp. Cryptography and Information Security, Okinawa, Japan, Jan. 2000, pp. 26-28.
43. E. Savaş and Ç. K. Koç, "Architectures for unified field inversion with applications in proc. vol. 3," in Proc. 9th IEEE Int. Conf. Electronics, Circuits and Systems-ICECS 2002, Sept. 2002, pp. 1155-1158.
44. E. Savaş and Ç. K. Koç, "The Montgomery modular inverse-revisited," IEEE Trans. Comput., vol. 49, no. 7, pp. 763-766, July 2000.
45. E. Savaş, M. Naseer, A. A.-A. Gutub, and Ç. K. Koç, "Efficient unified Montgomery inversion with multibit shifting," IEE Proc. Comput. Digital Tech., vol. 152, no. 4, pp. 489-498, July 2005.
46. k)," IEE Proc. Comput. Digital Tech., vol. 151, no. 2, pp. 147-160, Mar. 2004.
47. m)," in Cryptographic Hardware and Embedded Systems-CHES 2000 (LNCS, vol. 1965), Ç. K. Koç and C. Paar, Eds. New York: Springer-Verlag, 2000, pp. 281-296.
48. A. Shamir, "Identity-based cryptosystems and signature schemes," in Proc. CRYPTO, 1984, pp. 47-53.
49. D. Suzuki, "How to maximize the potential of FPGA resources for modular exponentiation," in CHES (LNCS, vol. 4727). New York: Spring-er-Verlag, 2007, pp. 272-288.
50. S. H. Tang, K. S. Tsui, and P. H. W. Leong, "Modular exponentiation using parallel multipliers," in Proc. 2003 IEEE Int. Conf. Field Programmable Technology (FPT), 2003, pp. 52-59.
51. A. F. Tenca and Ç. K. Koç, "A scalable architecture for Montgomery multiplication," in Cryptographic Hardware and Embedded Systems (LNCS, vol. 1717), Ç. K. Koç and C. Paar, Eds. New York: Springer-Verlag, 1999, pp. 94-108.
52. A. F. Tenca and L. A. Tawalbeh, "An efficient and scalable radix-4 modular multiplier design using recoding techniques," in Proc. 37th Asilomar Conf. Signals, Systems, and Computers. Pacific Grove, CA: IEEE Press, Nov. 9-12, 2003, no. 2, pp. 1445-1450.
53. A. F. Tenca, G. Todorov, and Ç. K. Koç, "High-radix design of a scalable modular multiplier," in CHES, (LNCS, vol. 2162), Ç. K. Koç, D. Naccache, and C. Paar, Eds. New York: Springer-Verlag, 2001, pp. 185-201.
54. C. D. Walter, "Faster modular multiplication by operand scaling," in Advances in Cryptology-CRYPTO'91 (LNCS, No. 576), J. Feigenbaum, Ed. New York: Springer-Verlag, 1992, pp. 313-323.
55. C. D. Walter, "Montgomery exponentiation needs no final subtractions," Electron. Lett., vol. 35, no. 21, pp. 1831-1832, Oct. 1999.
56. X ilinx Inc. Trust Zone technology overview [Online]. Available: http://www.xilinx.com/support/documentation/data-sheets/ds312.pdf.
57. T. Yanik, E. Savaş, and Ç. K. Koç, "Incomplete reduction in modular arithmetic," IEE Proc. Comput. Digital Tech., vol. 149, no. 2, pp. 46-52, Mar. 2002.