Sciweavers

722 search results - page 1 / 145
» Efficient Generation of Prime Numbers
Sort
View
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
13 years 8 months ago
Efficient Generation of Prime Numbers
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...
Marc Joye, Pascal Paillier, Serge Vaudenay
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 5 months ago
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
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 ...
Xiaodong Wu, Mong-Li Lee, Wynne Hsu
IEEEIAS
2007
IEEE
13 years 10 months ago
An LSB Data Hiding Technique Using Prime Numbers
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...
Sandipan Dey, Ajith Abraham, Sugata Sanyal
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
13 years 8 months ago
An Efficient Discrete Log Pseudo Random Generator
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 ...
Sarvar Patel, Ganapathy S. Sundaram
DCC
2004
IEEE
14 years 4 months ago
Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes
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...
Andrew Klapper, Jinzhong Xu