Reduction optimal trinomials for efficient software implementation of the ηT pairing

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

Volumn 4752 LNCS, Issue , 2007, Pages 44-57

  Nakajima, Toshiya ^a   Izu, Tetsuya ^a   Takagi, Tsuyoshi ^b  

^a FUJITSU LABORATORIES LTD   (Japan)

^b FUTURE UNIVERSITY HAKODATE   (Japan)

Author keywords

Characteristic three; Finite field; Irreducible polynomial; Pairing; Reduction optimal trinomial; Software implementation

Indexed keywords

COMPUTATIONAL EFFICIENCY; POLYNOMIAL APPROXIMATION;

IRREDUCIBLE POLYNOMIALS; REDUCTION OPTIMAL TRINOMIALS; SOFTWARE IMPLEMENTATION;

SOFTWARE ENGINEERING;

EID: 38149133166     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75651-4_4     Document Type: Conference Paper

References (23)

1. Barreto, P.S.L.M.: A Note on Efficient Computation of Cube Roots in Characteristic Three, Cryptology ePrint Archive, Report 2004/305 (2004)
2. Barreto, P.S.L.M., Galbraith, S.D., Ó'hÉigeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designs, Codes and Cryptography 42(3), 239-271 (2007) Designs
3. Barreto, P.S.L.M., Kim, H.Y., 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)
4. m) Arithmetic Architectures for Cryptographic Applications. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 158-175. Springer, Heidelberg (2003)
5. T Pairing Calculation in Characteristic Three and its Hardware Implementation. In: 18th IEEE International Symposium on Computer Arithmetic, ARITH-18, pp.97-104 (2007) In:18th IEEE International Symposium on Computer Arithmetic
6. Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
7. Boneh, D., Gentry, C., Waters, B.: Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258-275. Springer, Heidelberg (2005)
8. Boneh, D., Lynn, B., Shacham, H.: Short Signature from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514-532. Springer, Heidelberg (2001)
9. p - x + d. In: Laih, C S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111-123. Springer, Heidelberg (2003)
10. Galbraith, S.D.: Supersingular Curves in Cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 495-513. Springer, Heidelberg (2001)
11. Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS-V 2002. LNCS, vol. 2369, pp. 324-337. Springer, Heidelberg (2002)
12. Granger, R., Page, D., Stam, M.: Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three. IEEE Trans. on Computers 54(7), 852-860 (2005)
13. Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS-IV. LNCS, vol. 1838, pp. 385-393. Springer, Heidelberg (2000)
14. Koblitz, N.: An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 327-337. Springer, Heidelberg (1998)
15. Kwon, S.: Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. In: Boyd, C., Gonzalez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 134-145. Springer, Heidelberg (2005)
16. Miller, V.S.: Short Programs for Functions on Curves, (Unpublished manuscript), Available at http://crypto.stanford.edu/miller/miller.pdf Short Programs for Functions on Curves
17. 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)
18. Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems Based on Pairing, in Proceedings of the 2000 Symposium on Cryptography and Information Security, SCIS2000-C70 (2000) Cryptosystems Based on Pairing, in Proceedings of the 2000 Symposium on Cryptography and Information Security, SCIS2000-C70
19. T Pairing, 3rd Information Security Practice and Experience Conference. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol. 4464, pp. 254-268. Springer, Heidelberg (2007)
20. von zur Gathen, J.: Irreducible Trinomials over Finite Fields. Math. Comp. 72(244), 1987-2000 (2003) Irreducible Trinomials over Finite Fields. Math. Comp.
21. Risa/Asir: Available at http://www.math.kobe-u.ac.jp/Asir/asir.html
22. Document of 32-bit CPU: Available at http://www.fujitsu.com/us/services/ edevices/microelectronics/microcontrollers/fr32bitseries/
23. Document of 16-bit CPU: Available at http://www.fujitsu.com/us/services/ edevices/microelectronics/microcontrollers/f2mc/161core.html