Sciweavers

406 search results - page 23 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
AAECC
1990
Springer
100views Algorithms» more  AAECC 1990»
15 years 3 months ago
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
IJAIT
2002
81views more  IJAIT 2002»
14 years 11 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
ASIACRYPT
2004
Springer
15 years 4 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
ANOR
2010
102views more  ANOR 2010»
14 years 11 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
DCG
2000
44views more  DCG 2000»
14 years 11 months ago
Icosahedra Constructed from Congruent Triangles
It is possible to construct a figure in 3 dimensions which is combinatorially equivalent to a regular icosahedron, and whose faces are all congruent but not equilateral. Such icos...
E. N. Miller