Results 151 to 160 of about 585 (189)

Quasigroup Representation of Some Feistel and Generalized Feistel Ciphers

Advances in Intelligent Systems and Computing, 2013
There are several block ciphers designed by using Feistel networks or their generalization, and some of them allow to be represented by using quasigroup transformations, for suitably defined quasigroups. We are interested in those Feistel ciphers and Generalized Feistel ciphers whose round functions in their Feistel networks are bijections.
Aleksandra Mileva
exaly   +3 more sources

On Lai–Massey and quasi-Feistel ciphers

Designs, Codes, and Cryptography, 2010
For finite sets \(\mathcal{X}\), \(\mathcal{Y}\) a combiner over \((\mathcal{X},\mathcal{Y})\) is a parameterized family \(\Gamma = {\{ {\Gamma _z}\} _{z \in \mathcal{Y}}}\) of quasigroups \({\Gamma _z}:{\mathcal{X}^2} \to \mathcal{X}\), denote \({\Gamma _z}(x,y) = \Gamma \left[\left[ {x*y|z} \right]\right]\). Let \(b > 1\), \(r > 1\) be fixed integers,
Aaram Yun, Je Hong Park, Jooyoung Lee
exaly   +4 more sources

Feistel Ciphers Based on a Single Primitive

Lecture Notes in Computer Science, 2023
Tetsu Iwata, Iwata Tetsu
exaly   +2 more sources

Revisiting Key-Alternating Feistel Ciphers for Shorter Keys and Multi-user Security [PDF]

Lecture Notes in Computer Science, 2018
Key-Alternating Feistel (KAF) ciphers, a.k.a. Feistel-2 models, refer to Feistel networks with round functions of the form $F_i(k_i\oplus x_i)$, where $k_i$ is the (secret) round-key and $F_i$ is a public random function.
Chun Guo
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Guide to Feistel Ciphers

Information Security and Cryptography
Jacques Patarin, Emmanuel Volte, Benoit Cogliati   +2 more
exaly   +2 more sources

Feistel ciphers in East Germany in the communist era

Cryptologia, 2018
Feistel ciphers (balanced and unbalanced) represent the most popular symmetric cipher type in modern cryptography.
Nicolas T Courtois, Klaus Schmeh
exaly   +2 more sources

On the (In)Equivalence of Impossible Differential and Zero-Correlation Distinguishers for Feistel- and Skipjack-Type Ciphers

Lecture Notes in Computer Science, 2014
For many word-oriented block ciphers, impossible differential (ID) and zero-correlation linear (ZC) cryptanalyses are among the most powerful attacks. Whereas ID cryptanalysis makes use of differentials which never occur, the ZC cryptanalysis relies on ...
Celine Blondeau, Andrey Bogdanov, Meiqin Wang   +2 more
exaly   +2 more sources

Analysis of minimum numbers of linearly active S-boxes of a class of generalized feistel block ciphers [PDF]

Journal of Systems Science and Complexity, 2012
For a class of generalized Feistel block ciphers, an explicit recurrent formula for the minimum numbers of linearly active $S$-boxes of any round $r$ is ...
Kejian Xu
exaly   +2 more sources

Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers

Applied Mathematics and Computation, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E C Laskari, Yannis C Stamatiou, M N Vrahatis   +2 more
exaly   +3 more sources

Information leakage of Feistel ciphers

IEEE Transactions on Information Theory, 2001
Summary: The author examines the information leakage between sets of plaintext and ciphertext bits in symmetric-key block ciphers. The paper demonstrates the effectiveness of information leakage as a measure of cipher security by relating information leakage to linear cryptanalysis and by determining a lower bound on the amount of data required in an ...
openaire   +2 more sources