378 search results - page 15 / 76 » A Traceable Block Cipher |
CRYPTO
2007
Springer
14 years 3 months ago
2007
Springer
This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using a...
FSE
2003
Springer
14 years 2 months ago
2003
Springer
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
FSE
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. In this paper we compare systems of multivariate polynomials, which completely define the block ciphers Khazad, Misty1, Kasumi, Camellia, Rijndael and Serpent in the vie...
INDOCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
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, ...
IMA
1997
Springer
14 years 28 days ago
1997
Springer
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...