Sciweavers

247 search results - page 29 / 50
» On Pseudorandom Generators in NC
Sort
View
WEA
2005
Springer
109views Algorithms» more  WEA 2005»
14 years 1 months ago
Synchronization Fault Cryptanalysis for Breaking A5/1
Abstract. A5/1 pseudo-random bit generator, known from GSM networks, potentially might be used for different purposes, such as secret hiding during cryptographic hardware testing, ...
Marcin Gomulkiewicz, Miroslaw Kutylowski, Heinrich...
IH
2004
Springer
14 years 27 days ago
On the Possibility of Non-invertible Watermarking Schemes
Recently, there are active discussions on the possibility of non-invertible watermarking scheme. A non-invertible scheme prevents an attacker from deriving a valid watermark from a...
Qiming Li, Ee-Chien Chang
IACR
2011
113views more  IACR 2011»
12 years 7 months ago
KISS: A Bit Too Simple
KISS (‘Keep it Simple Stupid’) is an efficient pseudo-random number generator originally specified by G. Marsaglia and A. Zaman in 1993. G. Marsaglia in 1998 posted a C versio...
Greg Rose
IJNSEC
2010
143views more  IJNSEC 2010»
13 years 2 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
14 years 1 months ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans