Results 31 to 40 of about 13,379 (184)
New Genetic Operators for Developing S-Boxes With Low Boomerang Uniformity
IEEE Access, 2022 The boomerang uniformity measures the resistance of block ciphers to boomerang attacks and has become an essential criterion of the substitution box (S-box).
Man Kang, Mingsheng Wang
doaj +1 more source
IEEE Access, 2021 Machine learning has recently started to gain the attention of cryptographic researchers, notably in block cipher cryptanalysis. Most of these machine learning-based approaches are black box attacks that are cipher-specific.
Ting Rong Lee +4 more
doaj +1 more source
Security Analysis of Key-Alternating Feistel Ciphers? [PDF]
, 2014 . We study the security of key-alternating Feistel ciphers, a class of key-alternating ciphers with a Feistel structure. Alternatively, this may be viewed as the study of Feistel ciphers where the pseudoran-dom round functions are of the form Fi(x ⊕ ki),
Lampe, Rodolphe +3 more
core +2 more sources
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.
Baignères, Thomas, Finiasz, Matthieu
openaire +1 more source
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
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction [PDF]
Journal of Cryptology, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coron, Jean-Sébastien +5 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 - δ).
openaire +1 more source
Towards Analyzable Design Paradigms for Chaos-Based Cryptographic Primitives
Journal of Cybersecurity and PrivacyAlthough many chaos-based cryptosystems have been proposed over the past decade, they have yet to gain traction in real-world applications. A key reason for this is that most designs rely on security through obscurity, with unnecessarily complex ...
Abubakar Abba +3 more
doaj +1 more source
Research on Block Cipher Technology [PDF]
ITM Web of ConferencesWith the rapid advancement of information technology, Humanity will enter the era of the Internet of Things, with billions of IoT devices connected to the network, and network attacks targeting user privacy, network environment, etc.
Yin Yuanhao
doaj +1 more source
The Importance and Mechanics of Near‐Seafloor Oxygenation Events in Shallow Coastal Environments
Journal of Geophysical Research: Oceans, Volume 131, Issue 9, September 2026.Abstract Bottom‐water oxygen (O2) possibly constitutes the strongest regulating factor on ecosystem function of the seafloor environment. The conventional view of bottom‐water O2 regulation in temperate regions is a strong seasonal variability imposed by deposition of fresh, labile organic carbon following the spring and fall plankton bloom generating ...
Jonas P. Fredriksson +4 more
wiley +1 more source