The Caligo operations are performed on whole blocks only. No subdivision passes through an s-box or a Feistel network. The cipher definition is the same for any block size, allowing exhaustive search for statistical deviations on small block variants. I also propose CHash, a hash function that takes advantage of the cipher extensibility and resists the extension attack.

In this paper presents the Linear Cryptanalysis on S-DES and Symmetric Block Ciphers Using Hill Cipher Method. As a vehicle of demonstration of this concept, choose simple yet representative block ciphers such as computationally tractable versions of S-DES, for the studies. The attack presented in this paper is applicable to block structure independently of the key scheduling. The attack needs ...

We propose a novel methodology to design Block Cipher functions. This methodology is illustrated with the design of a specific block cipher function Maya. Our design philosophy is to derive the SBoxes themselves from the secret key. This makes breaking any round function equivalent to guessing all the key-bits. Advantages of our design include much larger key sizes in relation to the block size...

In this paper we propose a new cryptanalytic method against block ciphers, which combines both algebraic and statistical techniques. More specifically, we show how to use algebraic relations arising from differential characteristics to speed up and improve key-recovery differential attacks against block ciphers in some situations. To illustrate the new technique, we apply it to reduced round ve...

This paper presents a 64-bit lightweight block cipher TWINE supporting 80 and 128bit keys. TWINE realizes quite small hardware implementation similar to the previous lightweight block cipher proposals, yet enables efficient software implementations on various platforms, from micro-controller to high-end CPU. This characteristic is obtained by the use of generalized Feistel structure combined wi...

This paper presents a 64-bit lightweight block cipher TWINE supporting 80 and 128bit keys. TWINE realizes quite small hardware implementation similar to the previous lightweight block cipher proposals, yet enables efficient software implementations on various platforms, from micro-controller to high-end CPU. This characteristic is obtained by the use of generalized Feistel structure combined wi...

In this paper, we suggest an advanced method searching for differential trails of block cipher with ARX structure. We use two techniques to optimize the automatic search algorithm of differential trails suggested by Biryukov et al. and obtain 2~3 times faster results than the previous one when implemented in block cipher SPECK.

The SMS4 block cipher is part of the Chinese WAPI wireless standard. It is a 32-round block cipher with 128-bit blocks and 128-bit keys. This paper explores algebraic attacks on SMS4 using Gröbner basis attacks on equation systems over GF(2) and GF(28), as well as attacks using a SAT solver derived from the GF(2) model.

This paper proposes the Turing stream cipher. Turing offers up to 256-bit key strength, and is designed for extremely efficient software implementation.It combines an LFSR generator based on that of SOBER [21] with a keyed mixing function reminiscent of a block cipher round. Aspects of the block mixer round have been derived from Rijndael [6], Twofish [23], tc24 [24] and SAFER++ [17].

In this paper, we present a general review of hash functions in a cryptographic sense. We give special emphasis on some particular topics such as cipher block chaining message authentication code (CBC MAC) and its variants. This paper also broadens the information given in [1], by including more details on block-cipher based hash functions and security of different hash schemes.