17 search results - page 3 / 4 » Open Problems Related to Algebraic Attacks on Stream Ciphers |
CCS
2006
ACM
13 years 9 months ago
2006
ACM
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
TCOS
2010
13 years 22 days ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...
JAR
2000
13 years 5 months ago
2000
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
ACISP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. XL was first introduced to solve determined or overdetermined systems of equations over a finite field as an “algebraic attack” against multivariate cryptosystems....
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
We propose a new type of guess-and-determine attack on the self-shrinking generator (SSG). The inherent flexibility of the new attack enables us to deal with different attack condi...