Sciweavers

42 search results - page 7 / 9
» The Specialization and Transformation of Constructive Existe...
Sort
View
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 7 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
Ueli M. Maurer, Stefano Tessaro
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 8 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≄ 1āˆ’Ļ (where the probability is over the...
Ronen Shaltiel
AES
2004
Springer
139views Cryptology» more  AES 2004»
15 years 6 months ago
The Inverse S-Box, Non-linear Polynomial Relations and Cryptanalysis of Block Ciphers
This paper is motivated by the design of AES. We consider a broader question of cryptanalysis of block ciphers having very good non-linearity and diffusion. Can we expect anyway, ...
Nicolas Courtois
ICALP
2010
Springer
15 years 6 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 1 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson