In this paper we give a general framework for the analysis of block ciphers using the statistical technique of likelihood estimation We show how various recent successful cryptanalyses of block ciphers can be regarded in this framework By analysing the SAFER block cipher in this framework we expose a cryptographic weakness of that cipher

This note describes a parallelizable block-cipher mode of operation that simultaneously provides privacy and authenticity. It does this using only djM j=ne + 2 block cipher invocations. Here M is the plaintext (an arbitrary bit string) and n is the block length. The scheme refines one recently suggested by Jutla [Ju00].

We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construction is based on a 3round Feistel, and is more efficient than first building a n-bit random oracle from a n-bit ideal cipher (as in [6]) and then a 2n-bit ideal cipher from a n-bit random oracle (as in [7], using a 6-ro...

The r-rounds Even–Mansour block cipher is a generalization of the well known Even–Mansour block cipher to r iterations. Attacks on this construction were described by Nikolić et al. and Dinur et al. for r = 2, 3. These attacks are only marginally better than brute force but are based on an interesting observation (due to Nikolić et al.): for a “typical” permutation P, the distribution of P(x)⊕ ...

The FEAL N cryptosystem has been developed by N T T as a highly programming e cient block cipher system as it does not use look up tables It was rst presented in It is essentially an N round Feistel block cipher operating on bit blocks and determined by a bit key FEAL is the standard block cipher but N T T intend that FEAL can be used in cipher block chaining mode when plaintexts are not reveal...

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 easy to derive many equivalent distinct descriptions of the same instance of the block cipher; but it is computationally difficult, given one or even up to k of them, to recover the so-called meta-key from which they wer...

We study the problem of constructing a block-cipher on a “possibly-strange” set S using a block-cipher on a larger set T . Such constructions are useful in format-preserving encryption, where for example the set S might contain “valid 9-digit social security numbers” while T might be the set of 30-bit strings. Previous work has solved this problem using a technique called cycle walking, first f...

Recently an algorithmic schema was proposed for converting any existing block cipher into one which excepts variable length inputs with the computational workload increasing in proportion to the block size. The resulting cipher is referred to as an elastic block cipher. The initial work presented immunity to certain key recovery attacks, and left open further analysis of the method and its poss...

Hummingbird is a new ultra-light cryptographic algorithm targeted for resource constrained devices like Radio Frequency Identification ( RFID) tags, smart cards and wireless sensor nodes. In this project we implement an encryption and decryption on the low cost Xilinx FPGA .This project present a technique to reduce power consumption and improves the operating speed and hence the frequency. Thi...