Sciweavers

722 search results - page 1 / 73
» Efficient Generation of Prime Numbers
Sort
View
114 views 130 votes 15 years 7 months ago  CHES 2000»
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...
155 views 252 votes 16 years 5 months ago  ICDE 2004»
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
157 views 159 votes 15 years 10 months ago  IEEEIAS 2007»
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]. First we mathematically m...
105 views 131 votes 15 years 8 months ago  CRYPTO 1998»
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
98 views 107 votes 16 years 3 months ago  DCC 2004»
In this paper, we describe a solution to the register synthesis problem for a class of sequence generators known as Algebraic Feedback Shift Registers. These registers are based o...
133 views 160 votes 15 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...
87 views 120 votes 15 years 6 months ago  AAAI 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...
160 views 118 votes 15 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 views 121 votes 15 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...
96 views 124 votes 15 years 3 months ago  IJNSEC 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...