Results 11 to 20 of about 39,607 (176)
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
Ergodic Theory and Dynamical Systems, 2017 For non-invertible maps, subshifts that are mainly of finite type and piecewise monotone interval maps, we investigate what happens if we follow backward trajectories, which are random in the sense that, at each step, every preimage can be chosen with equal probability. In particular, we ask what happens if we try to compute the entropy this way.
Misiurewicz, Michal, Rodrigues, Ana
openaire +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
Computing preimages of Boolean networks [PDF]
BMC Bioinformatics, 2013 Submitted to WCSB ...
Klotz, Johannes +2 more
openaire +3 more sources
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
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
Preimage Problem Inspired by the F-Transform
Mathematics, 2022 In this article, we focus on discrete data processing. We propose to use the concept of closeness, which is less restrictive than a metric, to describe a certain relationship between objects.
Jiří Janeček, Irina Perfilieva
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
Ergodic Theory and Dynamical Systems, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fiebig, Doris +2 more
openaire +3 more sources