Faster double-struck F p-arithmetic for cryptographic pairings on Barreto-Naehrig curves

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

Volumn 5747 LNCS, Issue , 2009, Pages 240-253

  Fan, Junfeng ^a   Vercauteren, Frederik ^a,b   Verbauwhede, Ingrid ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

Author keywords

BN curves; Modular reduction; Pairings

Indexed keywords

A-COEFFICIENT; ART HARDWARE; BN CURVES; CURVE PARAMETERS; MODULAR REDUCTION; MONTGOMERY REDUCTION; PAIRINGS; POLYNOMIAL RINGS; REDUCTION PHASE; SPEED-UPS;

ALGORITHMS; COMPUTATIONAL EFFICIENCY; HARDWARE;

EMBEDDED SYSTEMS;

EID: 70350583035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04138-9_18     Document Type: Conference Paper

References (18)

1. 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-369. Springer, Heidelberg (2002)
2. Barrett, P.: Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311-323. Springer, Heidelberg (1987)
3. Beuchat, J., Detrey, J., Estibals, N., Okamoto, E., Rodríguez- Henríquez, F.: Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers. Cryptology ePrint Archive, Report 2009/122 (2009), http://eprint.iacr.org/
4. Chung, J., Hasan, M.A.: Low-Weight Polynomial Form Integers for Efficient Modular Multiplication. IEEE Trans. Comput. 56(1), 44-57 (2007)
5. Chung, J., Hasan, M.A.: Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers. In: ARITH 2007: Proceedings of the 18th IEEE Symposium on Computer Arithmetic, Washington, DC, USA, 2007, pp. 230-239. IEEE Computer Society Press, Los Alamitos (2007)
6. Dahab, R., Devegili, A., Ó'hÉigeartaigh, C., Scott, M.: Multiplication and Squaring on Pairing-Friendly Fields. Cryptology ePrint Archive, Report 2006/ /471, http://eprint.iacr.org
7. Devegili, A.J., Scott, M., Dahab, R.: Implementing Cryptographic Pairings over Barreto-Naehrig Curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 197-207. Springer, Heidelberg (2007)
8. Dhem, J.-F.: Design of an efficient public-key cryptographic library for RISC-based smart cards. PhD thesis, Universite catholique de Louvain, Louvain-la-Neuve, Belgium (1998)
9. Grabher, P., Großschädl, J., Page, D.: On Software Parallel Implementation of Cryptographic Pairings. In: Avanzi, R., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 35-50. Springer, Heidelberg (2008)
10. Hankerson, D., Menezes, A., Scott, M.: Software implementation of Pairings. In: Joye, M., Neven, G. (eds.) Identity-Based Cryptography (2008)
11. Hess, F., Smart, N.P., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transactions on Information Theory 52(10), 4595-4602 (2006)
12. Kammler, D., Zhang, D., Schwabe, P., Scharwaechter, H., Langenberg, M., Auras, D., Ascheid, G., Leupers, R., Mathar, R., Meyr, H.: Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves. Cryptology ePrint Archive, Report 2009/056 (2009), http://eprint.iacr.org/
13. Lee, E., Lee, H.-S., Park, C.-M.: Efficient and Generalized Pairing Computation on Abelian Varieties. Cryptology ePrint Archive, Report 2009/040, http://eprint.iacr.org/
14. Miller, V.S.: Short Programs for Functions on Curves (unpublished manuscript) (1986), http://crypto.stanford.edu/miller/miller.pdf
15. Miller, V.S.: The Weil Pairing, and Its Efficient Calculation. Journal of Cryptology 17(4), 235-261 (2004)
16. Montgomery, P.: Modular Multiplication without Trial Division. Mathematics of Computation 44(170), 519-521 (1985)
17. Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319-331. Springer, Heidelberg (2006)
18. Shu, C., Kwon, S., Gaj, K.: FPGA Accelerated Tate Pairing Based Cryptosystems over Binary Fields. In: Proceedings of IEEE International Conference on Field Programmable Technology (FPT), pp. 173-180 (2006)