Sciweavers

100 search results - page 2 / 20
» Arithmetic on superelliptic curves
Sort
View
EUROCRYPT
2011
Springer
12 years 11 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
IPL
2007
105views more  IPL 2007»
13 years 7 months ago
Improving the arithmetic of elliptic curves in the Jacobi model
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
Sylvain Duquesne
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 9 months ago
Efficient Arithmetic on Hessian Curves
This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite filed Fq, it ...
Reza Rezaeian Farashahi, Marc Joye
IACR
2011
124views more  IACR 2011»
12 years 7 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
PKC
2011
Springer
212views Cryptology» more  PKC 2011»
12 years 10 months ago
On the Correct Use of the Negation Map in the Pollard rho Method
Bos, Kaihara, Kleinjung, Lenstra, and Montgomery recently showed that ECDLPs on the 112-bit secp112r1 curve can be solved in an expected time of 65 years on a PlayStation 3. This p...
Daniel J. Bernstein, Tanja Lange, Peter Schwabe