209 search results - page 34 / 42 » Supersingular Curves in Cryptography |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Secret sharing in user hierarchy represents a challenging area for research. Although a lot of work has already been done in this direction, this paper presents a novel approach t...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
SACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper presents a distributed user authentication scheme in wireless sensor networks. Our scheme is based on the self-certified keys cryptosystem (SCK), and we have modified i...
ARITH
2007
IEEE
14 years 2 months ago
2007
IEEE
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...