20 search results - page 2 / 4 » Primality Proving Using Elliptic Curves: An Update |
INDOCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
DCC
2001
IEEE
14 years 5 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
EUROPKI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
IACR
2011
12 years 5 months ago
2011
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...