Results 1 to 10 of about 2,222 (156)
Automatic Preimage Attack Framework on Ascon Using a Linearize-and-Guess Approach
IACR Transactions on Symmetric Cryptology, 2023 Ascon is the final winner of the lightweight cryptography standardization competition (2018 − 2023). In this paper, we focus on preimage attacks against round-reduced Ascon.
Weidong Qiu
exaly +3 more sources
Improved Preimage Attacks on 4-Round Keccak-224/256 [PDF]
IACR Transactions on Symmetric Cryptology, 2021 This paper provides an improved preimage attack method on standard 4-round Keccak-224/256. The method is based on the work pioneered by Li and Sun, who design a linear structure of 2-round Keccak-224/256 with 194 degrees of freedom left.
Le He, Xiaoen Lin, Hongbo Yu
doaj +2 more sources
Improved MITM Cryptanalysis on Streebog
IACR Transactions on Symmetric Cryptology, 2022 At ASIACRYPT 2012, Sasaki et al. introduced the guess-and-determine approach to extend the meet-in-the-middle (MITM) preimage attack. At CRYPTO 2021, Dong et al.
Jialiang Hua +5 more
doaj +1 more source
Predictive analysis of two bijectively related families of functions in L2, which are expressed as tuple pairs [PDF]
E3S Web of Conferences, 2020 This article proposes a method of function image prediction calculation by its preimage. This method is based on regression analysis of function image and preimage pairs in L2. The prediction model application procedure is described.
Mosin V G, Abashkin A. A.
doaj +1 more source
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
IACR Transactions on Symmetric Cryptology, 2020 Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes.
Zhenzhen Bao +4 more
doaj +1 more source
Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems
IET Information Security, 2023 In this paper, improved preimage attacks are presented on 3‐round Keccak‐256 and Keccak‐512 and 4‐round Keccak‐256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing ...
Junling Pei, Lusheng Chen
doaj +1 more source
Classical and Quantum Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
IACR Transactions on Symmetric Cryptology, 2023 At EUROCRYPT 2006, Kelsey and Kohno proposed the so-called chosen target forced-prefix (CTFP) preimage attack, where for any challenge prefix P, the attacker can generate a suffix S such that H(P∥S) = y for some hash value y published in advance by the ...
Zhiyu Zhang +3 more
doaj +1 more source
Improved Preimage Attacks on 3-Round Keccak-224/256
IACR Transactions on Symmetric Cryptology, 2021 In this paper, we provide an improved method on preimage attacks of standard 3-round Keccak-224/256. Our method is based on the work by Li and Sun. Their strategy is to find a 2-block preimage instead of a 1-block one by constructing the first and second
Xiaoen Lin, Le He, Hongbo Yu
doaj +1 more source
Pre-image of functions in $C(L)$ [PDF]
Categories and General Algebraic Structures with Applications, 2021 Let $C(L)$ be the ring of all continuous real functions on a frame $L$ and $S\subseteq{\mathbb R}$. An $\alpha\in C(L)$ is said to be an overlap of $S$, denoted by $\alpha\blacktriangleleft S$, whenever $u\cap S\subseteq v\cap S$ implies $\alpha(u)\leq ...
Ali Rezaei Aliabad, Morad Mahmoudi
doaj +1 more source
Localic maps constructed from open and closed parts [PDF]
Categories and General Algebraic Structures with Applications, 2017 Assembling a localic map $fcolon Lto M$ from localic maps $f_icolon S_ito M$, $iin J$, defined on closed resp. open sublocales $(J$ finite in the closed case$)$ follows the same rules as in the classical case.
Ales Pultr, Jorge Picado
doaj +2 more sources