126 search results - page 15 / 26 » On the Use of Weber Polynomials in Elliptic Curve Cryptograp... |
ASIACRYPT
2008
Springer
13 years 10 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
WAIFI
2010
Springer
14 years 11 days ago
2010
Springer
Abstract. A large set of moduli, for which the speed of bipartite modular multiplication considerably increases, is proposed in this work. By considering state of the art attacks o...
FPL
2010
Springer
13 years 6 months ago
2010
Springer
Integer addition is a universal building block, and applications such as quad-precision floating-point or elliptic curve cryptography now demand precisions well beyond 64 bits. Thi...
ASIACRYPT
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
PAIRING
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we propose a very simple and efficient encoding function from Fq to points of a hyperelliptic curve over Fq of the form H : y2 = f(x) where f is an odd polynomial. Hy...