722 search results - page 2 / 145 » Efficient Generation of Prime Numbers |
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...
AAAI
2007
13 years 7 months ago
2007
The purpose of this paper is to extend the notions of prime implicates and prime implicants to the basic modal logic K. We consider a number of different potential definitions of...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1] based on decomposition of ...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
IJNSEC
2008
13 years 4 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...