Results 1  10
of
446
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 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
Security of balanced and unbalanced feistel schemes with linear non equalities
 IACR Cryptology ePrint Archive
"... Abstract. In this paper we will study 2 security results “above the birthday bound ” related to secret key cryptographic problems. 1. The classical problem of the security of 4, 5, 6 rounds balanced Random Feistel Schemes. 2. The problem of the security of unbalanced Feistel Schemes with contracting ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. In this paper we will study 2 security results “above the birthday bound ” related to secret key cryptographic problems. 1. The classical problem of the security of 4, 5, 6 rounds balanced Random Feistel Schemes. 2. The problem of the security of unbalanced Feistel Schemes
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
On Generalized Feistel Networks
 CRYPTO 2010
, 2010
"... We prove beyondbirthdaybound security for most of the wellknown types of generalized Feistel networks: (1) unbalanced Feistel networks, where the nbit to mbit round functions may have n \ne m; (2) alternating Feistel networks, where the round functions alternate between contracting and expandin ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
We prove beyondbirthdaybound security for most of the wellknown types of generalized Feistel networks: (1) unbalanced Feistel networks, where the nbit to mbit round functions may have n \ne m; (2) alternating Feistel networks, where the round functions alternate between contracting
Unbalanced Feistel Networks and BlockCipher Design
 Fast Software Encryption, 3rd International Workshop Proceedings
, 1996
"... We examine a generalization of the concept of Feistel networks, which we call Unbalanced Feistel Networks (UFNs). Like conventional Feistel networks, UFNs consist of a series of rounds in which one part of the block operates on the rest of the block. However, in a UFN the two parts need not be of eq ..."
Abstract

Cited by 71 (5 self)
 Add to MetaCart
We examine a generalization of the concept of Feistel networks, which we call Unbalanced Feistel Networks (UFNs). Like conventional Feistel networks, UFNs consist of a series of rounds in which one part of the block operates on the rest of the block. However, in a UFN the two parts need
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
LaiMassey Scheme and QuasiFeistel Networks (Extended Abstract)
"... Abstract. We introduce the notion of quasiFeistel network, which is generalization of the Feistel network, and contains the LaiMassey scheme as an instance. We show that some of the works on the Feistel network, including the works of LubyRackoff, Patarin, NaorReingold and Piret, can be naturall ..."
Abstract
 Add to MetaCart
prove the birthday security of (2b − 1) and (3b − 2)round unbalanced quasiFeistel networks with b branches against CPA and CPCA attacks, respectively. This answers an unsolved problem pointed out by Patarin et al. Keywords LaiMassey scheme, Feistel network, LubyRackoff, block cipher design
Generalized Birthday Attacks on Unbalanced Feistel Networks
 in proceedings of Crypto’98, LNCS
, 1998
"... Abstract. Unbalanced Feistel networks Fk which are used to construct invertible pseudorandom permutations from kn bits to kn bits using d pseudorandom functions from n bits to (k − 1)n bits, k ≥ 2 are studied. We show a new generalized birthday attack on Fk with d ≤ 3k − 3. With 2 (k−1)n chosen pl ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Unbalanced Feistel networks Fk which are used to construct invertible pseudorandom permutations from kn bits to kn bits using d pseudorandom functions from n bits to (k − 1)n bits, k ≥ 2 are studied. We show a new generalized birthday attack on Fk with d ≤ 3k − 3. With 2 (k−1)n chosen
Cryptanalysis of a Generalized Unbalanced Feistel Network Structure⋆
"... Abstract. This paper reevaluates the security of GFNLFSR, a new kind of generalized unbalanced Feistel network structure that was proposed at ACISP 2009. We show that GFNLFSR itself reveals a very slow diffusion rate, which could lead to several distinguishing attacks. For GFNLFSR containing n s ..."
Abstract
 Add to MetaCart
Abstract. This paper reevaluates the security of GFNLFSR, a new kind of generalized unbalanced Feistel network structure that was proposed at ACISP 2009. We show that GFNLFSR itself reveals a very slow diffusion rate, which could lead to several distinguishing attacks. For GFNLFSR containing n
Results 1  10
of
446