Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Bilinear, non-degenerate pairings on elliptic curves over finite fields have many applications in cryptography. The efficient computation of those pairings with variants of Miller's algorithm is part of this research area. \textit{F. Vercauteren} [``Optimal pairings'', IEEE Trans. Inf. Theory 56, No. 1, 455--461 (2010; \url{doi:10.1109/TIT.2009.2034881})] introduced the concept of an optimal pairing, which is by definition a pairing for which Miller's basic algorithm performs an expected minimal number of iterations. A summary of recent constructions of pairing-friendly elliptic curves is given in [\textit{D. Freeman} et al., J. Cryptology 23, No. 2, 224--280 (2010; Zbl 1181.94094)]. There are several approaches to achieve optimal pairings, in particular, variants of the so-called Ate or R-ate pairing. In this article, the authors provide several families of pairing-friendly curves. For each family, they explain how to obtain an optimal pairing by following the Ate or R-ate pairing approach. | |||
Property / review text: Bilinear, non-degenerate pairings on elliptic curves over finite fields have many applications in cryptography. The efficient computation of those pairings with variants of Miller's algorithm is part of this research area. \textit{F. Vercauteren} [``Optimal pairings'', IEEE Trans. Inf. Theory 56, No. 1, 455--461 (2010; \url{doi:10.1109/TIT.2009.2034881})] introduced the concept of an optimal pairing, which is by definition a pairing for which Miller's basic algorithm performs an expected minimal number of iterations. A summary of recent constructions of pairing-friendly elliptic curves is given in [\textit{D. Freeman} et al., J. Cryptology 23, No. 2, 224--280 (2010; Zbl 1181.94094)]. There are several approaches to achieve optimal pairings, in particular, variants of the so-called Ate or R-ate pairing. In this article, the authors provide several families of pairing-friendly curves. For each family, they explain how to obtain an optimal pairing by following the Ate or R-ate pairing approach. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Andreas Stein / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94A60 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11T71 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14G15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 14G50 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6048430 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Tate pairing | |||
Property / zbMATH Keywords: Tate pairing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Ate pairing | |||
Property / zbMATH Keywords: Ate pairing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
R-ate pairing | |||
Property / zbMATH Keywords: R-ate pairing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
optimal pairing | |||
Property / zbMATH Keywords: optimal pairing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pairing-friendly curves | |||
Property / zbMATH Keywords: pairing-friendly curves / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
elliptic curves | |||
Property / zbMATH Keywords: elliptic curves / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pairing computation | |||
Property / zbMATH Keywords: pairing computation / rank | |||
Normal rank |
Revision as of 23:36, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal pairing computation over families of pairing-friendly elliptic curves |
scientific article |
Statements
Optimal pairing computation over families of pairing-friendly elliptic curves (English)
0 references
20 June 2012
0 references
Bilinear, non-degenerate pairings on elliptic curves over finite fields have many applications in cryptography. The efficient computation of those pairings with variants of Miller's algorithm is part of this research area. \textit{F. Vercauteren} [``Optimal pairings'', IEEE Trans. Inf. Theory 56, No. 1, 455--461 (2010; \url{doi:10.1109/TIT.2009.2034881})] introduced the concept of an optimal pairing, which is by definition a pairing for which Miller's basic algorithm performs an expected minimal number of iterations. A summary of recent constructions of pairing-friendly elliptic curves is given in [\textit{D. Freeman} et al., J. Cryptology 23, No. 2, 224--280 (2010; Zbl 1181.94094)]. There are several approaches to achieve optimal pairings, in particular, variants of the so-called Ate or R-ate pairing. In this article, the authors provide several families of pairing-friendly curves. For each family, they explain how to obtain an optimal pairing by following the Ate or R-ate pairing approach.
0 references
Tate pairing
0 references
Ate pairing
0 references
R-ate pairing
0 references
optimal pairing
0 references
pairing-friendly curves
0 references
elliptic curves
0 references
pairing computation
0 references