Sciweavers

76 search results - page 3 / 16
» Pipelining GF(P) Elliptic Curve Cryptography Computation
Sort
View
85
Voted
CHES
2010
Springer
132views Cryptology» more  CHES 2010»
14 years 11 months ago
Efficient Techniques for High-Speed Elliptic Curve Cryptography
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
Patrick Longa, Catherine H. Gebotys
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
15 years 1 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
Eric Brier, Marc Joye
JSS
2011
106views more  JSS 2011»
14 years 1 months ago
A family of implementation-friendly BN elliptic curves
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
C. C. F. Pereira Geovandro, Marcos A. Simplí...
75
Voted
ARITH
2009
IEEE
15 years 5 months ago
Hybrid Binary-Ternary Joint Form and Its Application in Elliptic Curve Cryptography
Jithra Adikari, Vassil S. Dimitrov, Laurent Imbert
CHES
2004
Springer
167views Cryptology» more  CHES 2004»
15 years 3 months ago
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement a...
Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eb...