Instruction set extensions for pairing-based cryptography

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

Volumn 4575 LNCS, Issue , 2007, Pages 208-224

  Vejda, Tobias ^a   Page, Dan ^b   Großschädl, Johann ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; DIGITAL SIGNAL PROCESSING; GENERAL PURPOSE COMPUTERS;

CO-PROCESSORS; FIELD ARITHMETIC; GENERAL-PURPOSE PROCESSOR; HARDWARE ACCELERATORS; INSTRUCTION SET EXTENSIONS; INSTRUCTION SETS; INTERNATIONAL CONFERENCES; PAIRING-BASED CRYPTOGRAPHY; PROCESSOR CORES; VARIATIONS OF;

CRYPTOGRAPHY;

EID: 50049133586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73489-5_11     Document Type: Conference Paper

References (43)

1. 3m. Available at: http://www.cacr.math.uwaterloo.ca/ajmeneze/ publications/ cuberoots.pdf
2. n). In: Application-Specific Systems, Architectures and Processors (ASAP), pp. 226-236. IEEE Press, Los Alamitos (2003)
3. Austrin, P.: Efficient Arithmetic in Finite Fields of Small, Odd Characteristic. MSc Thesis, Royal Institute of Technology, Stockholm (2004)
4. Avizienis, A.: Signed-Digit Number Representations for Fast Parallel Arithmetic. IRE Transactions on Electronic Computers 10(9), 389-400 (1961)
5. Bajard, J.-C., Duprat, J., Kla, S., Muller, J.-M.: Some Operators for On-Line Radix-2 Computations. Journal of Parallel and Distributed Computing 22(2), 336-345 (1994)
6. Barreto, P.S.L.M., Galbraith, S., ÓhÉigeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. In: Cryptology ePrint Archive, Report 2004/375 (2004)
7. Barreto, P.S.L.M., Kim, H., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354-368. Springer, Heidelberg (2002)
8. Bertoni, G., Breveglieri, L., Fragneto, P., Pelosi, G.: Parallel Hardware Architectures for the Cryptographic Tate Pairing. In: Information Technology: New Generations (ITNG), pp. 186-191, IEEE Press, Los Alamitos (2006)
9. m) Arithmetic Architectures for Cryptographic Applications. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 158175. Springer, Heidelberg (2003)
10. Beuchat, J.-L., Shirase, M., Takagi, T., Okamoto, E.: An Algorithm for the ηT Pairing Calculation in Characteristic Three and its Hardware Implementation. In: Cryptology ePrint Archive, Report 2006/327 (2006)
11. Comba, P.G.: Exponentiation cryptosystems on the IBM PC. IBM Systems Journal 29(4), 526-538 (1990)
12. Dutta, R., Barua, R., Sarkar, P.: Pairing-Based Cryptographic Protocols: A Survey. In: Cryptology ePrint Archive, Report 2004/064 (2004)
13. p - x + d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
14. Fong, K., Hankerson, D., López, J., Menezes, A.: Field Inversion and Point Halving Revisited. Technical Report CORR 2003-18, University of Waterloo (2003)
15. Gaisler, J.: The LEON-2 Processor User's Manual (Version 1.0.30) (July 2005), Available for download at http://www.gaisler.com
16. Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) Algorithmic Number Theory (ANTS-V). LNCS, vol. 2369, pp. 324-337. Springer, Heidelberg (2002)
17. Grabher, P., Page, D.: Hardware Acceleration of the Tate Pairing in Characteristic Three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 398-411. Springer, Heidelberg (2005)
18. Granger, R., Page, D., Smart, N.P.: High Security Pairing-Based Cryptography Revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory (ANTS-VII). LNCS, vol. 4076, pp. 480-494. Springer, Heidelberg (2006)
19. Granger, R., Page, D., Stam, M.: Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three. IEEE Transactions on Computers 54(7), 852-860 (2005)
20. m). In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 202-218. Springer, Heidelberg (2001)
21. Großschädl, J., Kumar, S., Paar, C.: Architectural Support for Arithmetic in Optimal Extension Fields. In: Application-Specific Systems, Architectures and Processors (ASAP), pp. 111-124. IEEE Press, Los Alamitos (2004)
22. m). In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol, 3156, pp. 133-147. Springer, Heidelberg (2004)
23. Großschädl, J., Tillich, S., Szekely, A.: Cryptography Instruction Set Extensions to the SPARC V8 Architecture. Preprint (submitted for publication, 2007)
24. Hankerson, D.R., Menezes, A.J., Vanstone, S.A.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
25. Harrison, K., Page, D., Smart, N.P.: Software Implementation of Finite Fields of Characteristic Three, for use in Pairing Based Cryptosystems. LMS Journal of Computation and Mathematics 5(1), 181-193 (2002)
26. Hess, F., Smart, N.P., Vercauteren, F.: The Eta Pairing Revisited. Transactions on Information Theory 52, 4595-4602 (2006)
27. Kerins, T., Marnane, W.P., Popovici, E.M., Barreto, P.S.L.M.: Efficient Hardware for the Tate Pairing Calculation in Characteristic Three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 412-426. Springer, Heidelberg (2005)
28. Kerins, T., Popovici, E., Marnane, W.P.: Algorithms and Architectures for Use in FPGA Implementations of Identity Based Encryption Schemes. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 74-83. Springer, Heidelberg (2004)
29. Kumar, S., Paar, C.: Reconfigurable Instruction Set Extension for Enabling ECC on an 8-Bit Processor. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 586-595. Springer, Heidelberg (2004)
30. Kwon, S.: Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 134-145. Springer, Heidelberg (2005)
31. Miller, V.: Short programs for functions on curves. Available at: http://crypto.stanford.edu/miller/miller.pdf
32. Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44(170), 519-521 (1985)
33. Öztürk, E., Savas, E., Sunar, B.: A Versatile Montgomery Multiplier Architecture with Characteristic Three Support. Available at: http://ece.wpi. edu/sunar/preprints/versatile.pdf
34. Page, D., Smart, N.P.: Hardware Implementation of Finite Fields of Characteristic Three. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 529-539. Springer, Heidelberg (2003)
35. Ronan, R., ÓhÉigeartaigh, C., Murphy, C., Scott, M., Kerins, T., Marnane, W.P.: An Embedded Processor for a Pairing-Based Cryptosystem. In: Information Technology: New Generations (ITNG), pp. 192-197. IEEE Press, Los Alamitos (2006)
36. m). In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 277-295. Springer, Heidelberg (2000)
37. Scott, M.: Implementing Cryptographic Pairings, Available at: ftp://ftp. computing.dcu.ie/pub/resources/crypto/pairings.pdf
38. Scott, M., Costigan, N., Abdulwahab, W.: Implementing Cryptographic Pairings on Smartcards. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 134-147. Springer, Heidelberg (2006)
39. Takagi, N., Yajima, S.: Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem. IEEE Transactions on Computers 41(7), 887-891 (1992)
40. Takagi, N.: A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation. IEEE Transactions on Computers 41(8), 949-956 (1992)
41. Shirase, M., Takagi, T., Okamoto, E.: Some Efficient Algorithms for the Final Exponentiation of ηT Pairing. In: Cryptology ePrint Archive, Report 2006/431 (2006)
42. Shu, C., Kwon, S., Gaj, K.: FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields. In: Cryptology ePrint Archive, Report 2006/179 (2006)
43. SPARC International, Inc. The SPARC Architecture Manual Version 8 (August 1993) Available for download at http://www.sparc.org/standards/V8.pdf