Results 1  10
of
74
Generic Attacks on Feistel Schemes
 Advances in Cryptology – ASIACRYPT 2001
, 2001
"... Abstract. Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2 7n 4) computations with O(2 7n 4) random plaintext/cipher ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Abstract. Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2 7n 4) computations with O(2 7n 4) random plaintext
Differential Attacks on Generalized Feistel Schemes
"... Abstract. While generic attacks on classical Feistel schemes and unbalanced Feistel schemes have been studied a lot, generic attacks on several generalized Feistel schemes like type1, type2 and type3 and Alternating Feistel schemes, as defined in [6], have not been systematically investigated. Th ..."
Abstract
 Add to MetaCart
Abstract. While generic attacks on classical Feistel schemes and unbalanced Feistel schemes have been studied a lot, generic attacks on several generalized Feistel schemes like type1, type2 and type3 and Alternating Feistel schemes, as defined in [6], have not been systematically investigated
Security of Feistel Schemes with New and Various Tools
"... Abstract: We combine the H Coe cients technique and the Coupling technique to improve security bounds of balanced Feistel schemes. For q queries and round functions of n−bits to n−bits, we nd that the CCA Security of 4 + 2r rounds Feistel schemes is upperbounded by ..."
Abstract
 Add to MetaCart
Abstract: We combine the H Coe cients technique and the Coupling technique to improve security bounds of balanced Feistel schemes. For q queries and round functions of n−bits to n−bits, we nd that the CCA Security of 4 + 2r rounds Feistel schemes is upperbounded by
Feistel Schemes and BiLinear Cryptanalysis
 in Crypto 2004, LNCS 3152
, 2005
"... In this paper we introduce the method of bilinear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased characteristics that combine for an arbitrary number of rounds. In particular, we present a practical attack on DES based on a 1round i ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In this paper we introduce the method of bilinear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased characteristics that combine for an arbitrary number of rounds. In particular, we present a practical attack on DES based on a 1round
Generic attacks on Alternating Unbalanced Feistel Schemes
"... Abstract. Generic attacks against classical (balanced) Feistel schemes, unbalanced Feistel schemes with contracting functions and unbalanced Feistel schemes with expanding functions have been studied in [12], [4], [15], [16]. In this paper we study schemes where we use alternatively contracting rand ..."
Abstract
 Add to MetaCart
Abstract. Generic attacks against classical (balanced) Feistel schemes, unbalanced Feistel schemes with contracting functions and unbalanced Feistel schemes with expanding functions have been studied in [12], [4], [15], [16]. In this paper we study schemes where we use alternatively contracting
Generic Attacks on Feistel Schemes  Extended Version
 IACR EPRINT
, 2008
"... Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2^n) computations with O(2^n) nonadaptive chosen plaintexts. 2. It ..."
Abstract
 Add to MetaCart
Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2^n) computations with O(2^n) nonadaptive chosen plaintexts. 2
Generic Attacks on Feistel SchemesExtended Version
"... Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2n) computations with O(2n) nonadaptive chosen plaintexts. 2. It is ..."
Abstract
 Add to MetaCart
Let A be a Feistel scheme with 5 rounds from 2n bits to 2n bits. In the present paper we show that for most such schemes A: 1. It is possible to distinguish A from a random permutation from 2n bits to 2n bits after doing at most O(2n) computations with O(2n) nonadaptive chosen plaintexts. 2
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
 ASIACRYPT'07
, 2007
"... Unbalanced Feistel schemes with expanding functions are used to construct pseudorandom permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bits. At each round, all the bits except n bits are changed by using a function that depends only on these n bits. C.S.Jutla ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Unbalanced Feistel schemes with expanding functions are used to construct pseudorandom permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bits. At each round, all the bits except n bits are changed by using a function that depends only on these n bits. C
Results 1  10
of
74