52 search results - page 8 / 11 » How Fast can be Algebraic Attacks on Block Ciphers |
131
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we introduce the method of bi-linear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased character...
159
click to vote
CCS
2011
ACM
14 years 5 months ago
2011
ACM
XML Encryption was standardized by W3C in 2002, and is implemented in XML frameworks of major commercial and open-source organizations like Apache, redhat, IBM, and Microsoft. It ...
162
click to vote
FC
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
170
click to vote
CHES
2000
Springer
15 years 9 months ago
2000
Springer
This paper shows how a well-balanced trade-off between a generic workstation and dumb but fast reconfigurable hardware can lead to a more efficient implementation of a cryptanalysi...
188
click to vote
INDOCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient al...