Filters








1,699 Hits in 1.6 sec

Generic Attacks on Feistel Schemes [chapter]

Jacques Patarin
2001 Lecture Notes in Computer Science  
Since the complexities are smaller than the number 2 2n of possible inputs, they show that some generic attacks always exist on Feistel schemes with 5 rounds.  ...  This result is not really useful to attack a single 6 round Feistel permutation, but it shows that when we have to generate several pseudorandom permutations on a small number of bits we recommend to use  ...  I also would like to thank the anonymous referee of Asiacrypt'2001, for pointing out the references [2, 3] , and for observing that my attack against 5 round Feistel schemes will not in general apply  ... 
doi:10.1007/3-540-45682-1_14 fatcat:vm2hlqbb2vg6foxzfp6aii6y2i

Quantum Generic Attacks on Feistel Schemes [article]

Hong Wang, Zhi Ma
2017 arXiv   pre-print
The Feistel scheme is an important structure in the block ciphers. The security of the Feistel scheme is related to distinguishability with a random permutation.  ...  Furthermore, the method presented in this paper can also be used to consider unbalanced Feistel schemes with expanding functions.  ...  Quantum Attack on Classical Feistel scheme Attack on The variant 3-round FS This section shows that quantum algorithm can make less queries to distinguish a variant of the 3-round Feistel scheme VFS  ... 
arXiv:1010.1624v3 fatcat:txbfn2fp7bcjfkrqa4cs5mxavy

Differential Attacks on Generalized Feistel Schemes [chapter]

Valérie Nachef, Emmanuel Volte, Jacques Patarin
2013 Lecture Notes in Computer Science  
While generic attacks on classical Feistel schemes and unbalanced Feistel schemes have been studied a lot, generic attacks on several generalized Feistel schemes like type-1, type-2 and type-3 and Alternating  ...  We give our best Known Plaintext Attacks and non-adaptive Chosen Plaintext Attacks on these schemes and we determine the maximum number of rounds that we can attack.  ...  Generic Attacks on Unbal- anced Feistel Schemes with Expanding Functions.  ... 
doi:10.1007/978-3-319-02937-5_1 fatcat:lfcgsb4divau5bupccyxfn3hji

Generic Key Recovery Attack on Feistel Scheme [chapter]

Takanori Isobe, Kyoji Shibutani
2013 Lecture Notes in Computer Science  
We propose new generic key recovery attacks on Feistel-type block ciphers.  ...  cipher by a Feistel scheme such as a low-latency cipher.  ...  Fig. 8 . 8 Matrix Separation Table 1 . 1 Numbers of Attacked Rounds by Generic Attacks on Feistel Schemes Single Secret Key Setting Attack Type Feistel-1 Feistel-2 Feistel-3 5 [30] 5 [30] 5 [30  ... 
doi:10.1007/978-3-642-42033-7_24 fatcat:7ib6wifyvzditfsf7x6kic7saq

Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions [chapter]

Jacques Patarin, Valérie Nachef, Côme Berbain
2006 Lecture Notes in Computer Science  
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions.  ...  When d ≥ 2k, we also describe some attacks on schemes with generators, (i.e. schemes where the d pseudo-random functions are generated) and where more than one permutation is required.  ...  There are much more papers on classical Feistel schemes and even attacks on expanding unbalanced Feistel schemes have been more studied than attacks on contracting unbalanced Feistel schemes.  ... 
doi:10.1007/11935230_26 fatcat:sj6jooosnnd73frvcjrlkhmjqe

Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions [chapter]

Emmanuel Volte, Valérie Nachef, Jacques Patarin
2010 Lecture Notes in Computer Science  
Attacks on these generic schemes were studied in [7] and [18] .  ...  As pointed in [7] and [18], there are surprisingly much more possibilities for these attacks than for generic balanced Feistel schemes or generic unbalanced Feistel schemes with contracting functions.  ...  Generic attacks on Unbalanced Feistel Schemes with expanding functions is the theme of this paper.  ... 
doi:10.1007/978-3-642-17373-8_6 fatcat:nuvyb7gwsrhcpiu226ehsef4cq

Improved quantum attack on Type-1 Generalized Feistel Schemes and Its application to CAST-256 [article]

Boyu Ni, Xiaoyang Dong
2019 IACR Cryptology ePrint Archive  
Generalized Feistel Schemes (GFS) are important components of symmetric ciphers, which have been extensively researched in classical setting.  ...  Hence, we could derive quantum key-recovery attack on 19-round CAST-256. While the best previous quantum key-recovery attack is on 16 rounds.  ...  on Type-1 Generalized Feistel Schemes (GFS) in Q2 model with quantum chosen-plaintext attack (qCPA) setting and quantum chosen-ciphertext attack (qCCA) setting, respectively.  ... 
dblp:journals/iacr/NiD19 fatcat:rm4g7vjd3jadnaasz6rfad6lvy

Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions [chapter]

Jacques Patarin, Valérie Nachef, Côme Berbain
Advances in Cryptology – ASIACRYPT 2007  
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bits.  ...  In this paper, we describe novel Known Plaintext Attacks (KPA) and Non Adaptive Chosen Plaintext Attacks (CPA-1) against these schemes.  ...  Generic attacks on Unbalanced Feistel Schemes with expanding functions is the theme of this paper.  ... 
doi:10.1007/978-3-540-76900-2_20 dblp:conf/asiacrypt/PatarinNB07 fatcat:o4klgbjyvfc4nlwqptmz63lcky

Building Secure Block Ciphers on Generic Attacks Assumptions [chapter]

Jacques Patarin, Yannick Seurin
2009 Lecture Notes in Computer Science  
Our design strategy enables to give a reductionist security proof for the primitive based on plausible assumptions regarding the complexity of the best distinguishing attacks on random Feistel schemes  ...  opposition, other provably secure symmetric primitives, as for example C [3] and KFC [4], designed using information-theoretic results, are only proved to resist a limited (though significant) range of attacks  ...  Generic Attacks on Feistel Schemes Generic attacks on Ψ (3) and Ψ (4) .  ... 
doi:10.1007/978-3-642-04159-4_5 fatcat:lbxt5nkisza3paoaizw3wpuozu

SCARE of an Unknown Hardware Feistel Implementation [chapter]

Denis Réal, Vivien Dubois, Anne-Marie Guilloux, Frédéric Valette, Mhamed Drissi
2008 Lecture Notes in Computer Science  
Using this relation, two attacks for recovering the algorithm are proposed : an expensive interpolation attack on a generic Feistel scheme and an improved attack on a specific but commonly used scheme.  ...  In this paper, we claim that an unknown Feistel scheme with an hardware design can be recovered with a chosen plaintexts SCA attack.  ...  The Hardware Implementation of a Generic Feistel Scheme Assumption on the Feistel Scheme Design The logic function is an expensive resource on a cryptographic device, especially on a smart card.  ... 
doi:10.1007/978-3-540-85893-5_16 fatcat:7xd7ju7jq5bn3ihhsaxm6ziioi

Quantum Differential Collision Distinguishing Attacks on Feistel Schemes

ZHANG Zhongya, WU Wenling, WANG Bolin
2021 Chinese journal of electronics  
The schemes are subjected to quantum differential collision distinguishing attacks based on the methods.  ...  We examine the extension methods of differential distinguishers of Feistel key-function and Feistel function-key schemes.  ...  Complexities of differential collision distinguishing attacks on the Feistel-FK schemes 3 Scheme Conditions Differential attack Differential collision distinguishing attack Quantum differential attack  ... 
doi:10.1049/cje.2021.07.026 fatcat:kjcnrlzrcjhpjmvc54aozszhsa

Quantum key-recovery attack on Feistel structures

Xiaoyang Dong, Xiaoyun Wang
2018 Science China Information Sciences  
In this study, we investigate the Feistel constructions using Grover's and Simon's algorithms to generate new quantum key-recovery attacks on different rounds of Feistel constructions.  ...  Keywords quantum cryptanalysis, quantum key-recovery, Feistel structure, Simon, Grover Citation Dong X Y, Wang X Y. Quantum key-recovery attack on Feistel structures.  ...  [14] generated a series of key-recovery attacks on 5-to 32-round Feistel ciphers.  ... 
doi:10.1007/s11432-017-9468-y fatcat:wgy64wwntbemfoiutrsj5yvcbm

On Quantum Slide Attacks [article]

Xavier Bonnetain, María Naya-Plasencia, André Schrottenloher
2018 IACR Cryptology ePrint Archive  
In this paper we propose many other types of quantum slide attacks. First, we are able to quantize classical advanced slide attacks on Feistel networks.  ...  model for some self-similar SPN and Feistel constructions.  ...  Feistel Scheme with One Round Self-similarity and Modular Additions We consider from now on Feistel schemes, like the one represented in Figure 4 .  ... 
dblp:journals/iacr/BonnetainNS18 fatcat:i6s6b5fezbgrvetfjaixsoo57a

Best Effort and Practice Activation Codes [article]

Gerhard de Koning Gans, Eric R. Verheul
2011 arXiv   pre-print
The small message space of activation codes introduces some problems that are illustrated by an adaptive chosen-plaintext attack (CPA-2) on a general 3-round Feis- tel network of size 2^(2n) .  ...  Even though this class of codes is extensively used there are no general guidelines for the design of Activation Code schemes.  ...  A practical attack on a general 3-round Feistel network is presented to demonstrate the weak bounds of the Feistel construction.  ... 
arXiv:1101.0698v2 fatcat:mlaqpmlpyfalzdh33uvvxhr4t4

Breaking the FF3 Format-Preserving Encryption Standard over Small Domains [chapter]

F. Betül Durak, Serge Vaudenay
2017 Lecture Notes in Computer Science  
Due to this weakness, we reduced the FF3 attack to an attack on 4round Feistel network. Biryukov et. al. already gave a 4-round Feistel structure attack in SAC 2015.  ...  Therefore, we developed a new generic known-plaintext attack to 4-round Feistel network that reconstructs the entire tables for all round functions.  ...  As far as we know, there is no efficient generic attack which is polynomial in N on the Feistel scheme with q ∼ N.  ... 
doi:10.1007/978-3-319-63715-0_23 fatcat:wemboxfn5fhbxj763uq4yu6iom
« Previous Showing results 1 — 15 out of 1,699 results