|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
20 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Faster Pairing Computation | | Christophe Arene
; Tanja Lange
; Michael Naehrig
; Christophe Ritzenthaler
; | | Date: |
6 Apr 2009 | | Abstract: | This paper proposes new explicit formulas for the doubling and addition step
in Miller’s algorithm to compute pairings. For Edwards curves the formulas come
from a new way of seeing the arithmetic. We state the first geometric
interpretation of the group law on Edwards curves by presenting the functions
which arise in the addition and doubling. Computing the coefficients of the
functions and the sum or double of the points is faster than with all
previously proposed formulas for pairings on Edwards curves. They are even
competitive with all published formulas for pairing computation on Weierstrass
curves. We also speed up pairing computation on Weierstrass curves in Jacobian
coordinates. Finally, we present examples of pairing-friendly twisted Edwards
curves with embedding degree k=6. | | Source: | arXiv, 0904.0854 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER