178 search results - page 1 / 36 » On the Implementation of a Fast Prime Generation Algorithm |
CHES
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A side-channel analysis of a cryptographic algorithm generally concentrates on the encryption or decryption phases, rarely on the key generation phase. In this paper, we ...
CHES
2000
Springer
13 years 8 months ago
2000
Springer
The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appear...
CHES
2006
Springer
13 years 8 months ago
2006
Springer
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
IJCAI
1993
13 years 6 months ago
1993
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...