Results 31 to 40 of about 6,728,968 (223)
Wave-Shaped Round Functions and Primitive Groups [PDF]
, 2018 Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks and Feistel Networks, are often obtained as the composition of different layers which provide confusion and diffusion, and key ...
Aragona, Riccardo +4 more
core +2 more sources
Bit‐level evaluation of piccolo block cipher by satisfiability problem solver
IET Information Security, Volume 17, Issue 4, Page 616-625, July 2023., 2023 The authors conducted bit‐level evaluations of the Piccolo block cipher against differential, integral, and impossible differential attacks using SAT‐based approaches. Authors’ work successfully identified the optimal differential distinguisher against differential and related‐key differential attacks.
Shion Utsumi +2 more
wiley +1 more source
On Generalized Feistel Networks [PDF]
, 2010 We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions may have n ≠ m; (2) alternating Feistel networks, where the round functions alternate between contracting and expanding; (3) type-1, type-2, and type-3 Feistel networks ...
Viet Tung Hoang, Phillip Rogaway
openaire +1 more source
KLEIN: A New Family of Lightweight Block Ciphers [PDF]
, 2010 Resource-efficient cryptographic primitives become fundamental for realizing both security and efficiency in embedded systems like RFID tags and sensor nodes.
A. Bogdanov +39 more
core +6 more sources
Dynamic Selection of Symmetric Key Cryptographic Algorithms for Securing Data Based on Various Parameters [PDF]
, 2014 Most of the information is in the form of electronic data. A lot of electronic data exchanged takes place through computer applications. Therefore information exchange through these applications needs to be secure.
Abraham, Jibi +7 more
core +1 more source
Developments in generalised Feistel networks
Electronics Letters, 1999 Nyberg (1996) obtained an upper bound on the maximum average of differential probability for a generalised Feistel network. A counter-example to this result is given.
null Chee +3 more
openaire +1 more source
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 +1 more source
Proposed 256 bits RC5 Encryption Algorithm Using Type-3 Feistel Network [PDF]
Engineering and Technology Journal, 2010 Proposed 256 bits RC5 is an improvement to RC5, designed to meetthe requirements of increased security and better performance. Proposed256 bits RC5 algorithm makes use of data dependent rotations.
Yossra H. Ali
doaj +1 more source
The related-key analysis of feistel constructions [PDF]
, 2014 Lecture Notes in Computer Science, Volume 8540, 2015.It is well known that the classical three- and four-round Feistel constructions are provably secure under chosen-plaintext and chosen-ciphertext attacks, respectively.
A Biryukov +34 more
core +1 more source
On Fault Injections in Generalized Feistel Networks [PDF]
2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2014 In this paper, we propose a generic method to assess the vulnerability to Differential Fault Analysis of generalized Feistel networks (GFN). This method is based on an in-depth analysis of the GFN properties. First the diffusion of faults is studied, both at the block level and at the S-box level, in order to have a fault which maximizes the number of ...
Le Bouder, Hélène +3 more
openaire +2 more sources