52 search results - page 7 / 11 » How Fast can be Algebraic Attacks on Block Ciphers |
199
click to vote
ACISP
2006
Springer
15 years 11 months ago
2006
Springer
![On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions")
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...
182
click to vote
TCOS
2010
15 years 13 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 ...
158
click to vote
ICISC
2007
15 years 7 months ago
2007
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
152
click to vote
CHES
2009
Springer
16 years 6 months ago
2009
Springer
We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data- and key-dependent branches and mem...
155
click to vote
CTRSA
2008
Springer
15 years 7 months ago
2008
Springer
We present a study of several fault attacks against the block cipher IDEA. Such a study is particularly interesting because of the target cipher's specific property to employ ...