Results 21 to 30 of about 2,222 (156)
Exploiting Weak Diffusion of Gimli: Improved Distinguishers and Preimage Attacks
IACR Transactions on Symmetric Cryptology, 2021 The Gimli permutation proposed in CHES 2017 was designed for cross-platform performance. One main strategy to achieve such a goal is to utilize a sparse linear layer (Small-Swap and Big-Swap), which occurs every two rounds.
Fukang Liu, Takanori Isobe, Willi Meier
doaj +1 more source
Preimage problems for deterministic finite automata [PDF]
, 2021 Given a subset of states S of a deterministic finite automaton and a word w, the preimage is the subset of all states mapped to a state in S by the action of w. We study three natural problems concerning words giving certain preimages.
Berlinkov, M. V. +2 more
core +1 more source
Preimage Attacks on Some Hashing Modes Instantiating Reduced-Round LBlock
IEEE Access, 2018 In this paper, we present preimage attacks on several hashing modes instantiating reduced-round LBlock. It is observed that the omission of the network twist in the last round and the diffusion of the permutation in round function are the key points for ...
Shiwei Chen, Chenhui Jin
doaj +1 more source
Computing preimages of Boolean networks [PDF]
BMC Bioinformatics, 2013 Submitted to WCSB ...
Johannes Georg Klotz +2 more
openaire +4 more sources
Path tableaux and combinatorial interpretations of immanants for class functions on $S_n$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Let $χ ^λ$ be the irreducible $S_n$-character corresponding to the partition $λ$ of $n$, equivalently, the preimage of the Schur function $s_λ$ under the Frobenius characteristic map.
Sam Clearman +2 more
doaj +1 more source
Quantum Rotational Cryptanalysis for Preimage Recovery of Round-Reduced Keccak [PDF]
, 2022 This paper considers the capability of 4-round Keccak-224/256/384/512 against the cryptanlysis involved by the quantum algorithm. In order to effectively find the corresponding rotational number for the rotational counterpart of preimage, we first ...
Juntao Gao +4 more
core +1 more source
Indifferentiable hash functions in the standard model
IET Information Security, 2021 Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
Ergodic Theory and Dynamical Systems, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fiebig, Doris +2 more
openaire +3 more sources
Contractibility of a persistence map preimage [PDF]
Journal of Applied and Computational Topology, 2020 AbstractThis work is motivated by the following question in data-driven study of dynamical systems: given a dynamical system that is observed via time series of persistence diagrams that encode topological features of snapshots of solutions, what conclusions can be drawn about solutions of the original dynamical system? We address this challenge in the
Jacek Cyranka +2 more
openaire +3 more sources
Preimage Attacks on Reduced DHA-256 [PDF]
, 2009 DHA-256 (Double Hash Algorithm) was proposed at the Cryptographic Hash Workshop hosted by NIST in November 2005. DHA-256 is a dedicated hash function with output length of 256 bits and 64 steps of operations designed to enhance SHA-256 security.
Xuejia Lai, Jinmin Zhong
core +1 more source