Results 71 to 80 of about 585 (189)
RunFein: a rapid prototyping framework for Feistel and SPN-based block ciphers [PDF]
, 2016 Block ciphers are the most prominent symmetric-key cryptography kernels, serving as fundamental building blocks to many other cryptographic functions.
Hassan, Muhammad +4 more
core +1 more source
Deck-Based Wide Block Cipher Modes and an Exposition of the Blinded Keyed Hashing Model
IACR Transactions on Symmetric Cryptology, 2020 We present two tweakable wide block cipher modes from doubly-extendable cryptographic keyed (deck) functions and a keyed hash function: double-decker and docked-double-decker.
Aldo Gunsing, Joan Daemen, Bart Mennink
doaj +1 more source
Interactions Between Diurnal Warm Layers and Surface‐Layer Fronts
Journal of Geophysical Research: Oceans, Volume 130, Issue 1, January 2025.Abstract Previous studies have highlighted the individual importance of diurnal warm layers (DWLs) and surface‐layer fronts within the surface boundary layer (SBL) in regulating energy, momentum, and gas exchange between the atmosphere and the ocean. This study investigates the interactions between DWLs and surface‐layer fronts using field observations
Jen‐Ping Peng +8 more
wiley +1 more source
10-Round Feistel is Indifferentiable from an Ideal Cipher [PDF]
, 2016 We revisit the question of constructing an ideal cipher from a random oracle. Coron et al.i¾?Journal of Cryptology, 2014 proved that a 14-round Feistel network using random, independent, keyed round functions is indifferentiable from an ideal cipher, thus demonstrating the feasibility of such a transformation. Left unresolved is the number of rounds of
Dana Dachman-Soled +2 more
openaire +2 more sources
IET Image Processing, Volume 19, Issue 1, January/December 2025.This paper proposes a DNA‐Dynamic Concurrent Permutation‐Diffusion Algorithm (DNA‐DCP‐DA) for secure image encryption, employing novel scaling chaotification models and advanced noncommutative DNA operations to address weaknesses in existing systems.
Mustafa Kamil Khairullah +5 more
wiley +1 more source
Conditional Linear Cryptanalysis – Cryptanalysis of DES with Less Than 242 Complexity
IACR Transactions on Symmetric Cryptology, 2018 In this paper we introduce a new extension of linear cryptanalysis that may reduce the complexity of attacks by conditioning linear approximations on other linear approximations. We show that the bias of some linear approximations may increase under such
Eli Biham, Stav Perle
doaj +1 more source
, 2015 International audienceWhile many recent publications have shown strong relations between impossible differential, integral and zero-correlation distinguish- ers for SPNs and Feistel-like ciphers, this paper tries to bring grist to the mill to this ...
Berger, Thierry Pierre +3 more
core +1 more source
Research on deep differential fault analysis against MIBS
Tongxin xuebao, 2010 The MIBS algorithm and its differential fault analysis principle were presented,then three differential fault analysis methods against MIBS were proposed based on different depth of fault model and verified through experiments.Experiment results ...
ZHAO Xin-jie1 +3 more
doaj +2 more sources
Improved search models of boomerang distinguishers and application to LILLIPUT
CybersecurityBoomerang attack serves as a potent cryptanalytic tool for assessing the security of block ciphers. Over the past few years, various automatic search models for boomerang distinguishers have been proposed for block ciphers with different structures. This
Yunong Wu +6 more
doaj +1 more source
On Impossible Boomerang Attacks
IACR Transactions on Symmetric CryptologyThe impossible boomerang attack, introduced in 2008 by Jiqiang Lu, is an extension of the impossible differential attack that relies on a boomerang distinguisher of probability 0 for discarding incorrect key guesses.
Xavier Bonnetain +4 more
doaj +1 more source