406 search results - page 18 / 82 » Pseudorandomness and Combinatorial Constructions |
ASIACRYPT
2007
Springer
15 years 5 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
ACS
2004
14 years 11 months ago
2004
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The descr...
199
click to vote
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
102
Voted
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...