36 search results - page 1 / 8 » An Efficient Discrete Log Pseudo Random Generator |
CRYPTO
1998
Springer
13 years 8 months ago
1998
Springer
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 ...
EUROCAST
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register...
IPCV
2007
13 years 6 months ago
2007
- In this paper a Discrete Wavelet Transform based blind watermarking algorithm is proposed for embedding a grayscale watermark into a grayscale image. A new approach of choosing t...
RSA
2006
13 years 4 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...