81 search results - page 3 / 17 » Improving Fast Algebraic Attacks |
EUROCRYPT
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. This paper describes new methods for fast correlation attacks, based on the theory of convolutional codes. They can be applied to arbitrary LFSR feedback polynomials, in ...
SETA
2010
Springer
13 years 4 months ago
2010
Springer
It is a difficult challenge to find Boolean functions used in stream ciphers achieving all of the necessary criteria and the research of such functions has taken a significant d...
JSS
2007
13 years 6 months ago
2007
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...
FSE
2009
Springer
14 years 6 months ago
2009
Springer
In this paper we propose a new cryptanalytic method against block ciphers, which combines both algebraic and statistical techniques. More specifically, we show how to use algebraic...
TCOS
2010
13 years 29 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 ...