Results 171 to 180 of about 22,520 (195)

On the hypothesis of stochastic equivalence for Feistel ciphers

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002
We construct new S-boxes which provide Feistel ciphers with a high resistance against differential cryptanalysis.
openaire   +1 more source

Balanced Feistel Ciphers, First Properties

2017
Feistel ciphers are named after Horst Feistel who studied these schemes in the 1960s. In this chapter, we will only present classical Feistel ciphers, i.e. balanced Feistel ciphers with the ⊕ group law (Xor). In Chaps. 8, 9 and 10, we will see that there are many variants of these ciphers.
Valerie Nachef, Jacques Patarin, Emmanuel Volte   +2 more
openaire   +1 more source

On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation

2015
Feistel constructions have been shown to be indifferentiable from random permutations at STOC 2011. Whereas how to properly mix the keys into an un-keyed Feistel construction without appealing to domain separation technique to obtain a block cipher which is provably secure against known-key and chosen-key attacks (or to obtain an ideal cipher) remains ...
Chun Guo 0002, Dongdai Lin
openaire   +2 more sources

Swarm intelligence algorithms in cryptanalysis of simple Feistel ciphers

International Journal of Information and Communication Technology, 2018
Recent cryptosystems constitute a hard task for cryptanalysis algorithms due to the nonlinearity of their structure. This problem can be formulated as NP-hard. It has long been subject to various attacks; related results remain insufficient especially when handling wide instances due to resources requirement which increase with the size of the problem.
Tahar Mekhaznia 0001, Abdelmadjid Zidani
openaire   +2 more sources

Generic Attacks on Classical Feistel Ciphers with Internal Permutations

2017
In this chapter, generic attacks on Feistel networks with internal permutations, instead of Feistel networks with internal functions as designed originally are studied. As always in generic attacks, the internal permutations are supposed to be random.
Valerie Nachef, Jacques Patarin, Emmanuel Volte   +2 more
openaire   +1 more source

Full round impossible differentials for Feistel ciphers

Journal of Computer Virology and Hacking Techniques, 2023
Dmitry Zakharov, M. Pudovkina
openaire   +1 more source

An Extended Type-1 Generalized Feistel Networks: Lightweight Block Cipher for IoT

IEEE Internet of Things Journal, 2022
Songtao Guo, Jing He
exaly  

On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys

2001
Recent work by Biryukov and Wagner on developing the slide attack technique has revealed it to be a powerful tool in the analysis of block cipher designs. In this paper the technique is used to analyze a particular construction of balanced Feistel block cipher that features identically keyed round functions but with independent pre- and post-whitening ...
openaire   +2 more sources

Tweakable TWINE: Building a Tweakable Block Cipher on Generalized Feistel Structure

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020
Takanori Isobe, Andrey Bogdanov, Kōsei Sakamoto   +2 more
exaly  

Almost-Minimal-Round BBB-Secure Tweakable Key-Alternating Feistel Block Cipher

Symmetry, 2021
Ming Jiang
exaly