290 search results - page 20 / 58 » Pseudorandom Bits for Polynomials |
ANSS
2005
IEEE
14 years 3 months ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Although evolutionary algorithms (EAs) are often successfully used for the optimization of dynamically changing objective function, there are only very few theoretical re...
FSE
2005
Springer
14 years 3 months ago
2005
Springer
The bit-search generator (BSG) was proposed in 2004 and can be seen as a variant of the shrinking and self-shrinking generators. It has the advantage that it works at rate 1/3 usin...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
ESORICS
2008
Springer
13 years 11 months ago
2008
Springer
Current tools for analysing information flow in programs build upon ideas going back to Denning's work from the 70's. These systems enforce an imperfect notion of informa...