Sciweavers

406 search results - page 13 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
EUROCAST
2005
Springer
166views Hardware» more  EUROCAST 2005»
15 years 4 months ago
A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines
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...
Dominik Jochinger, Franz Pichler
ICANN
2005
Springer
15 years 4 months ago
Can Dynamic Neural Filters Produce Pseudo-Random Sequences?
Abstract. Dynamic neural filters (DNFs) are recurrent networks of binary neurons. Under proper conditions of their synaptic matrix they are known to generate exponentially large c...
Yishai M. Elyada, David Horn
CRYPTO
2010
Springer
151views Cryptology» more  CRYPTO 2010»
15 years 5 days ago
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
Yevgeniy Dodis, Krzysztof Pietrzak
SIAMDM
1998
86views more  SIAMDM 1998»
14 years 10 months ago
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
Douglas R. Stinson, Ruizhong Wei
SIAMCOMP
2011
14 years 6 months ago
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
Avraham Ben-Aroya, Amnon Ta-Shma