406 search results - page 26 / 82 » Pseudorandomness and Combinatorial Constructions |
ACNS
2005
Springer
14 years 4 months ago
2005
Springer
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
WEA
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. A5/1 pseudo-random bit generator, known from GSM networks, potentially might be used for different purposes, such as secret hiding during cryptographic hardware testing, ...
ASIACRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
DCG
2008
13 years 11 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
ANOR
2005
13 years 11 months ago
2005
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...