IACR
2011
12 years 12 months ago
2011
GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic eff...
IACR
2011
12 years 12 months ago
2011
The block cipher family for lightweight devices, KTANTAN, is analyzed in this paper. We propose a new cryptanalysis method which improves results of Meet-in-the-Middle attacks on K...
CANS
2011
Springer
13 years 8 days ago
2011
Springer
Abstract. In this paper we analyze the recently proposed light-weight block cipher PRINTCipher. Applying algebraic methods and SAT-solving we are able to break 8 rounds of PRINTCip...
TIT
2010
13 years 7 months ago
2010
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
TIT
2011
13 years 7 months ago
2011
—The boomerang analysis, together with its offspring the amplified boomerang analysis and the rectangle analysis, are techniques that are widely used in the analysis of block ci...
CISC
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. ESSENCE is a family of cryptographic hash functions, accepted to the first round of NIST's SHA-3 competition. This paper presents the first known attacks on ESSENCE....
CISC
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In 2002, algebraic attacks using overdefined systems of equations have been proposed as a potentially very powerful cryptanalysis technique against block ciphers. However...
JOC
1998
13 years 12 months ago
1998
We investigate some of the algebraic properties of the SAFER block cipher when the message space is considered as a Z-module. In particular we consider the invariant Z-submodules ...
INFORMATICASI
2002
13 years 12 months ago
2002
At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions from block ciphers and codes (block codes and convolutional codes). They claimed that their hash func...
CRYPTOLOGIA
2006
14 years 10 days ago
2006
In this paper, we describe Whirlpool, which is a block-cipher-based secure hash function. Whirlpool produces a hash code of 512 bits for an input message of maximum length less tha...