133 views161 votes15 years 7 months ago CHES 2006»
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...
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...
160 views119 votes15 years 4 months ago CORR 2010»
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 ...
139 views121 votes15 years 8 months ago ANTS 1998»
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...
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...
181 views116 votes15 years 4 months ago CORR 2010»
In this paper, a few novel data hiding techniques are proposed. These techniques are improvements over the classical LSB data hiding technique and the Fibonacci LSB data-hiding te...
Abstract. We present the first efficient statistical zero-knowledge protocols to prove statements such as: – A committed number is a prime. – A committed (or revealed) number ...
108 views118 votes15 years 5 months ago ICISC 2004»
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
130 views120 votes15 years 8 months ago CHES 2001»
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...