A family of implementation-friendly BN elliptic curves

被引:48
作者
Pereira, Geovandro C. C. F. [1 ]
Simplicio, Marcos A., Jr. [1 ]
Naehrig, Michael [2 ]
Barreto, Paulo S. L. M. [1 ]
机构
[1] Univ Sao Paulo, Escola Politecn, Dept Engn Comp & Sistemas Digitais PCS, BR-05508900 Sao Paulo, Brazil
[2] Microsoft Res, Redmond, WA 98052 USA
关键词
Pairing-based cryptosystems; Elliptic curve cryptosystems; Pairing-friendly curves; SOFTWARE IMPLEMENTATION; CRYPTOGRAPHIC PAIRINGS; SQUARE ROOTS; EFFICIENT; EXPONENTIATION; SIGNCRYPTION; COMPUTATION; SIGNATURES;
D O I
10.1016/j.jss.2011.03.083
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it provides with relatively small keys and to its ability to create very efficient and multifunctional cryptographic schemes by means of bilinear pairings. Pairings require pairing-friendly elliptic curves and among the possible choices, Barreto-Naehrig (BN) curves arguably constitute one of the most versatile families. In this paper, we further expand the potential of the BN curve family. We describe BN curves that are not only computationally very simple to generate, but also specially suitable for efficient implementation on a very broad range of scenarios. We also present implementation results of the optimal ate pairing using such a curve defined over a 254-bit prime field. (C) 2001 Elsevier Inc. All rights reserved.
引用
收藏
页码:1319 / 1326
页数:8
相关论文
共 46 条
[1]  
[Anonymous], P13633 IEEE
[2]  
[Anonymous], MULT INT RAT AR C C
[3]  
[Anonymous], THESIS TU EINDHOVEN
[4]  
[Anonymous], LECT NOTES IN PRESS
[5]  
[Anonymous], LECT NOTES COMPUTER
[6]  
[Anonymous], 2010, 2010542 CRYPT EPRINT
[7]  
[Anonymous], 2010134 IACR EPRINT
[8]  
[Anonymous], IEEE S COMP AR ARITH
[9]  
[Anonymous], LECT NOTES COMPUTER
[10]  
[Anonymous], 1985, LNCS