Results 51 to 60 of about 92 (77)
Some of the next articles are maybe not open access.

On Permutation Layer of Type 1, Source-Heavy, and Target-Heavy Generalized Feistel Structures

Lecture Notes in Computer Science, 2011
The Generalized Feistel Structure (GFS) generally uses the sub-block-wise cyclic shift in the permutation layer, the layer between the two F function layers. For Type 2 GFS, at FSE 2010, Suzaki and Minematsu showed that a better diffusion property can be obtained if one uses some other sub-block-wise permutation.
Tetsu Iwata
exaly   +2 more sources

Cryptanalysis on Three Kinds of Generalized Feistel Structures with Secret Round Functions

Arabian Journal for Science and Engineering, 2018
Since the structural cryptanalysis of SASAS was presented in Eurocrypt’01 for the first time, a series of studies focusing on the substitution–permutation structures and Feistel structures with secret inner components have sparked cryptanalysts’ great interests.
Ting Cui, Jiyan Zhang, Jin Chenhui
exaly   +2 more sources

Construction of $${\text {MDS}}$$ matrices from generalized Feistel structures

Designs, Codes and Cryptography, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mahdi Sajadieh, Mohsen Mousavi
openaire   +3 more sources

The development of generic key recovery attack on Feistel structure

Theoretical and Natural Science, 2023
Feistel structure was firstly proposed in 1973, and because its structure has a great avalanche effect and similar encryption and decryption, it was used in many encryption schemes, like DES, AES, CAST. According to the ambiguity of the intermediate state, Feistel structures are separately named as Feistel-1, Feistel-2 and Feistel-3.Even though some of
openaire   +1 more source

Structural Evaluation for Generalized Feistel Structures and Applications to LBlock and TWINE

2015
The generalized Feistel structure GFS is the variant of Feistel structure with $$m>2$$m>2 branches. While the GFS is widely used, the security is not well studied. In this paper, we propose a generic algorithm for searching integral distinguishers. By applying the algorithm, we prove that the low bound for the length of integral distinguishers is $$m^2+
Huiling Zhang, Wenling Wu
openaire   +2 more sources

A New Method for Finding Impossible Differentials of Generalized Feistel Structures

Chinese Journal of Electronics, 2018
Impossible differential cryptanalysis is one of the most powerful attacks against modern block ciphers. In most cases, the resistance of a block cipher against impossible differential cryptanalysis can be measured by the length of the longest impossible differentials.
Ting Cui, Chenhui Jin, Jing Ma
openaire   +1 more source

Accurate Estimation of the Full Differential Distribution for General Feistel Structures

2016
Statistical cryptanalysis is one of the most powerful tools to analyze symmetric key cryptographic primitives such as block ciphers. One of these attacks, the differential attack has been demonstrated to break a wide range of block ciphers. Block cipher proposals previously obtain a rough estimate of their security margin against differential attacks ...
Jiageng Chen   +3 more
openaire   +2 more sources

GFLE: a low-energy lightweight block cipher based on a variant of generalized Feistel structure

Physica Scripta
Abstract Low-energy lightweight block ciphers are essential for applications with extremely resource-constrained to reduce energy and maintain security. The trade-off between diffusion property and area is a widely studied issue in the design of low-energy block ciphers.
Minhua Hu   +3 more
openaire   +1 more source

Improved quantum attack on several generalized unbalanced Feistel structures

2022 International Conference on Networks, Communications and Information Technology (CNCIT), 2022
Zou Kun, Dong Xinfeng, Zhang Fuzhong
openaire   +1 more source

Home - About - Disclaimer - Privacy