5 search results - page 1 / 1 » How to Choose Secret Parameters for RSA-Type Cryptosystems o... |
DCC
2001
IEEE
14 years 4 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...
AAECC
2003
Springer
13 years 9 months ago
2003
Springer
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...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
WAIFI
2010
Springer
13 years 10 months ago
2010
Springer
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...