Sciweavers

13214 search results - page 10 / 2643
» Pseudorandomness for network algorithms
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 8 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
ICITS
2009
15 years 2 months ago
On the Security of Pseudorandomized Information-Theoretically Secure Schemes
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...
Koji Nuida, Goichiro Hanaoka
AHS
2007
IEEE
210views Hardware» more  AHS 2007»
15 years 11 months ago
Evaluation of a New Platform For Image Filter Evolution
This paper describes a new FPGA implementation of a system for evolutionary image filter design. Three parallel search algorithms are compared. An optimal mutation rate and the q...
Zdenek Vasícek, Lukás Sekanina
187
Voted
IPCV
2007
15 years 6 months ago
Quantization Based Blind Watermarking Algorithm Using DWT
- 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...
Shikha Tripathi, Sai Krishnan Ramachandran, Vijay ...
142
Voted
IMA
2005
Springer
71views Cryptology» more  IMA 2005»
15 years 10 months ago
Concrete Security of the Blum-Blum-Shub Pseudorandom Generator
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
Andrey Sidorenko, Berry Schoenmakers