Sciweavers

105 search results - page 11 / 21
» Efficient elliptic curve exponentiation
Sort
View
IJNSEC
2008
135views more  IJNSEC 2008»
13 years 7 months ago
Software Implementations of Elliptic Curve Cryptography
Elliptic Curve Cryptography (ECC) is a promising alternative for public-key algorithms in resource-constrained systems because it provides a similar level of security with much sh...
Zhijie Jerry Shi, Hai Yun
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...
IEICET
2008
126views more  IEICET 2008»
13 years 7 months ago
Skew-Frobenius Maps on Hyperelliptic Curves
The hyperelliptic curve cryptosystems take most of the time for computing a scalar multiplication kD of an element D in the Jacobian JC of a hyperelliptic curve C for an integer k....
Shunji Kozaki, Kazuto Matsuo, Yasutomo Shimbara
FOCS
2007
IEEE
13 years 11 months ago
Space-Efficient Identity Based Encryption Without Pairings
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which build...
Dan Boneh, Craig Gentry, Michael Hamburg
CHES
2003
Springer
115views Cryptology» more  CHES 2003»
14 years 22 days ago
The Doubling Attack - Why Upwards Is Better than Downwards
The recent developments of side channel attacks have lead implementers to use more and more sophisticated countermeasures in critical operations such as modular exponentiation, or ...
Pierre-Alain Fouque, Frédéric Valett...