Results 11 to 20 of about 585 (189)
Tweaking Key-Alternating Feistel Block Ciphers [PDF]
, 2020 Tweakable block cipher as a cryptographic primitive has found wide applications in disk encryption, authenticated encryption mode and message authentication code, etc. One popular approach of designing tweakable block ciphers is to tweak the generic constructions of classic block ciphers.
Hailun Yan +3 more
core +7 more sources
Practically secure Feistel ciphers [PDF]
DAIMI Report Series, 1994 In this paper we give necessary design principles to be used, when constructing secure Feistel ciphers. We introducee a new concept, <strong> practical security</strong> against linear and differential attacks on Feistel ciphers. We give examples of such Feistel ciphers (practically) resistant to differential attacks, linear attacks and ...
Knudsen, Lars Ramkilde
openaire +3 more sources
Quantum attacks on some feistel block ciphers [PDF]
Designs, Codes and Cryptography, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoyang Dong 0001 +2 more
openaire +3 more sources
Analysis of Diffusion Properties in Generalized Feistel Ciphers Under Multidimensional Linear Cryptanalysis [PDF]
IACR Transactions on Symmetric CryptologyThis paper presents a unified framework for generic attacks on Generalized Feistel Ciphers, with a primary focus on Type 1, Type 2, and unbalanced contracting (U-Type 1) Feistel constructions with non-invertible round functions.
Betül Aşkın Özdemir, Vincent Rijmen
doaj +3 more sources
Elastic Block Ciphers: The Feistel Cipher Case
, 2004 We discuss the elastic versions of block ciphers whose round function processes subsets of bits from the data block differently, such as occurs in a Feistel network and in MISTY1. We focus on how specific bits are selected to be swapped after each round when forming the elastic version, using an elastic version of MISTY1 and differential cryptanalysis ...
Cook, Debra L. +2 more
openaire +4 more sources
A New Cipher Based on Feistel Structure and Chaotic Maps
مجلة بغداد للعلوم, 2019 Chaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed ...
Al-Bahrani et al.
doaj +3 more sources
Quantum Chosen-Ciphertext Attacks Against Feistel Ciphers [PDF]
, 2019 Seminal results by Luby and Rackoff show that the 3-round Feistel cipher is secure against chosen-plaintext attacks (CPAs), and the 4-round version is secure against chosen-ciphertext attacks (CCAs). However, the security significantly changes when we consider attacks in the quantum setting, where the adversary can make superposition queries.
Gembu Ito +4 more
openaire +4 more sources
Feistel Ciphers with L 2-Decorrelation [PDF]
, 1999 Recently, we showed how to strengthen block ciphers by decorrelation techniques. In particular, we proposed two practical block ciphers, one based on the GF(2n)-arithmetics, the other based on the x mod p mod 2n primitive with a prime p = 2n(1 + δ). In this paper we show how to achieve similar decorrelation with a prime p = 2n(1 - δ).
Vaudenay, Serge
openaire +2 more sources
Generalized Feistel Ciphers for Efficient Prime Field Masking [PDF]
A recent work from Eurocrypt 2023 suggests that prime-field masking has excellent potential to improve the efficiency vs. security tradeoff of masked implementations against side-channel attacks, espe- cially in contexts where physical leakages show low noise. We pick up on the main open challenge that this seed result leads to, namely the design of an
Lorenzo Grassi +5 more
core +5 more sources
Unbalanced Feistel networks and block cipher design [PDF]
, 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 equal size. Removing this limitation on Feistel networks
Bruce Schneier, John Kelsey
openaire +2 more sources