290 search results - page 16 / 58 » Pseudorandom Bits for Polynomials |
EUROCRYPT
2003
Springer
14 years 3 months ago
2003
Springer
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking gen...
WEA
2005
Springer
14 years 3 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, ...
UIST
2010
ACM
13 years 7 months ago
2010
ACM
Multi-touch displays are particularly attractive for collaborative work because multiple users can interact with applications simultaneously. However, unfettered access can lead t...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
COCO
2001
Springer
14 years 2 months ago
2001
Springer
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...