400 search results - page 13 / 80 » Derandomization and Distinguishing Complexity |
104
click to vote
APPROX
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
174
click to vote
CP
2009
Springer
16 years 9 days ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
121
click to vote
IWSEC
2009
Springer
15 years 6 months ago
2009
Springer
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differ...
LATINCRYPT
2010
14 years 10 months ago
2010
Hamsi is one of the second round candidates of the SHA-3 competition. In this study, we present non-random differential properties for the compression function of the hash functio...
84
Voted
CTRSA
2006
Springer
15 years 3 months ago
2006
Springer
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...