A family of implementation-friendly BN elliptic curves


Autoria(s): PEREIRA, Geovandro C. C. F.; SIMPLICIO JR., Marcos A.; NAEHRIG, Michael; Barreto, Paulo Sergio Licciardi Messeder
Contribuinte(s)

UNIVERSIDADE DE SÃO PAULO

Data(s)

18/10/2012

18/10/2012

2011

Resumo

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.

Brazilian National Council for Scientific and Technological Development (CNPq)[303163/2009-7]

Identificador

JOURNAL OF SYSTEMS AND SOFTWARE, v.84, n.8, p.1319-1326, 2011

0164-1212

http://producao.usp.br/handle/BDPI/18149

10.1016/j.jss.2011.03.083

http://dx.doi.org/10.1016/j.jss.2011.03.083

Idioma(s)

eng

Publicador

ELSEVIER SCIENCE INC

Relação

Journal of Systems and Software

Direitos

restrictedAccess

Copyright ELSEVIER SCIENCE INC

Palavras-Chave #Pairing-based cryptosystems #Elliptic curve cryptosystems #Pairing-friendly curves #BARRETO-NAEHRIG CURVES #SOFTWARE IMPLEMENTATION #CRYPTOGRAPHIC PAIRINGS #FINITE-FIELDS #BILINEAR MAPS #SQUARE ROOTS #EFFICIENT #COMPUTATION #EXPONENTIATION #CRYPTOSYSTEMS #Computer Science, Software Engineering #Computer Science, Theory & Methods
Tipo

article

original article

publishedVersion