Sciweavers

386 search results - page 21 / 78
» The Block Cipher Rijndael
Sort
View
INDOCRYPT
2001
Springer
15 years 9 months ago
Cryptographic Functions and Design Criteria for Block Ciphers
Most last-round attacks on iterated block ciphers provide some design criteria for the round function. Here, we focus on the links between the underlying properties. Most notably, ...
Anne Canteaut
IMA
1997
Springer
106views Cryptology» more  IMA 1997»
15 years 8 months ago
Hash Functions and MAC Algorithms Based on Block Ciphers
This paper reviews constructions of hash functions and MAC algorithms based on block ciphers. It discusses the main requirements for these cryptographic primitives, motivates these...
Bart Preneel
CMS
2006
15 years 5 months ago
Perturbing and Protecting a Traceable Block Cipher
At the Asiacrypt 2003 conference Billet and Gilbert introduce a block cipher, which, to quote them, has the following paradoxical traceability properties: it is computationally ea...
Julien Bringer, Hervé Chabanne, Emmanuelle ...
CTRSA
2009
Springer
235views Cryptology» more  CTRSA 2009»
15 years 11 months ago
A Statistical Saturation Attack against the Block Cipher PRESENT
In this paper, we present a statistical saturation attack that combines previously introduced cryptanalysis techniques against block ciphers. As the name suggests, the attack is st...
Baudoin Collard, François-Xavier Standaert
FSE
2005
Springer
106views Cryptology» more  FSE 2005»
15 years 10 months ago
New Applications of T-Functions in Block Ciphers and Hash Functions
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
Alexander Klimov, Adi Shamir