209 search results - page 8 / 42 » Supersingular Curves in Cryptography |
INDOCRYPT
2001
Springer
14 years 9 days ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
CHES
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose a superscalar coprocessor for high-speed curvebased cryptography. It accelerates scalar multiplication by exploiting instruction-level parallelism (ILP) dynami...
ISCAS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This work describes the smallest known hardware implementation for Elliptic/Hyperelliptic Curve Cryptography (ECC/HECC). We propose two solutions for Publickey Cryptogr...
ANTS
2004
Springer
14 years 1 months ago
2004
Springer
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...
CARDIS
2000
Springer
14 years 6 days ago
2000
Springer
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...