5 search results - page 1 / 1 » Rewriting Variables: The Complexity of Fast Algebraic Attack... |
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
ASIACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
FCCM
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...