Results 21 to 30 of about 585 (189)
Post-quantum Security of Key-Alternating Feistel Ciphers [PDF]
Since Kuwakado and Morii's work (ISIT 2010 & ISITA 2012), it is known that the classically secure 3-round Luby-Rackoff PRP and Even-Mansour cipher become insecure against an adversary equipped with quantum query access. However, while this query model (the so-called Q2 model) has led to many more attacks, it seems that restricting the adversary to ...
Basak, Jyotirmoy +7 more
core +5 more sources
On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation [PDF]
, 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 +3 more sources
Automated design of a lightweight block cipher with Genetic Programming [PDF]
, 2008 In this paper, we present a general framework for the automated design of cryptographic block ciphers by using Genetic Programming. We evolve highly nonlinear and extremely efficient functions that can be used as core components of any cryptographic ...
Hernandez-Castro, Julio C. +3 more
core +1 more source
Full-round impossible differential attack on shadow block cipher
Cybersecurity, 2023 Lightweight block ciphers are the essential encryption algorithm for devices with limited resources. Its goal is to ensure the security of data transmission through resource-constrained devices.
Yuting Liu +3 more
doaj +1 more source
SLIM: A Lightweight Block Cipher for Internet of Health Things
IEEE Access, 2020 Nowadays, there is a strong demand for increasing the protection of resource-constrained devices such as Radio frequency identification (RFID) systems. Current cryptographic algorithms are sufficient for high-resource desktop computers.
Bassam Aboushosha +4 more
doaj +1 more source
Automatic Search of Rectangle Attacks on Feistel Ciphers: Application to WARP
IACR Transactions on Symmetric Cryptology, 2022 In this paper we present a boomerang analysis of WARP, a recently proposed Generalized Feistel Network with extremely compact hardware implementations.
Virginie Lallemand +2 more
doaj +1 more source
KFC – The Krazy Feistel Cipher [PDF]
, 2006 We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the advantage of the best d-limited adaptive distinguisher, for any value of d.
Thomas Baignères, Matthieu Finiasz
openaire +1 more source
On the Feistel Counterpart of the Boomerang Connectivity Table
IACR Transactions on Symmetric Cryptology, 2020 At Eurocrypt 2018, Cid et al. introduced the Boomerang Connectivity Table (BCT), a tool to compute the probability of the middle round of a boomerang distinguisher from the description of the cipher’s Sbox(es). Their new table and the following works led
Hamid Boukerrou +4 more
doaj +1 more source
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers [PDF]
, 2021 Key-Alternating Feistel (KAF) ciphers are a popular variant of Feistel ciphers whereby the round functions are defined as $x \mapsto F(k_i \oplus x)$, where k_i are the round keys and F is a public random function.
Yannick Seurin +3 more
core
IEEE Access, 2021 One of the main security requirements for symmetric-key block ciphers is resistance against differential cryptanalysis. This is commonly assessed by counting the number of active substitution boxes (S-boxes) using search algorithms or mathematical ...
Mohamed Fadl Idris +3 more
doaj +1 more source