Results 31 to 40 of about 2,222 (156)

Practical Preimages for Maraca

, 2009
We show a practical preimage attack on the cryptographic hash function Maraca, which was submitted as a candidate to the NIST SHA-3 competition. Our attack has been verified experimentially.
Indesteege, Sebastiaan, Preneel, Bart
openaire   +4 more sources

Counting preimages [PDF]

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

Method of restoring multivariable Boolean function from its derivative

Advanced Engineering Research, 2017
Introduction. Boolean functions of several variables are of paramount importance in the coding theory and cryptography. The compositions of these functions are used in a set of the symmetric cryptosystems; therewith, some error-control codes, such as ...
Alexander V. Mazurenko, Nadezhda S. Mogilevskaya   +1 more
doaj   +1 more source

Postorder Preimages

Discrete Mathematics & Theoretical Computer Science, 2017
Given a set $Y$ of decreasing plane trees and a permutation $\pi$, how many trees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometric constructions, we provide a method for answering this question for certain sets $Y$ and all permutations $\pi$.
openaire   +4 more sources

Preimage cardinalities of continuous functions [PDF]

Topology and its Applications, 2021
4 figures (another figure added)
openaire   +2 more sources

On preimage knots in 𝑆³

, 1987
In [1], Gordon proved that a certain sequence of preimage knots in S 3 {S^3} is finite. In this paper, we prove that every sequence of preimage knots is finite by using the Gromov invariant for knots.
Teruhiko Soma
core   +1 more source

Improved preimage and pseudo-collision attacks on SM3 hash function

Tongxin xuebao, 2018
A preimage attack on 32-step SM3 hash function and a pseudo-collision attack on 33-step SM3 hash function respectively were shown.32-step preimage attack was based on the differential meet-in-the-middle and biclique technique,while the previously known ...
Jian ZOU, Le DONG
doaj   +2 more sources

On Preimages Question

Journal of Number Theory
For a surjective self-morphism on a projective variety defined over a number field, we study the preimages question, which asks if the set of rational points on the iterated preimages of an invariant closed subscheme eventually stabilize. We prove the answer is positive for self-morphisms on $\mathbb{P}^1 \times \mathbb{P}^1$.
Yohsuke Matsuzawa, Kaoru Sano
openaire   +2 more sources

Cryptanalysis of Haraka

IACR Transactions on Symmetric Cryptology, 2016
In this paper, we describe attacks on the recently proposed Haraka hash functions. First, for the two hash functions Haraka-256/256 and Haraka-512/256 in the family, we show how two colliding messages can be constructed in about 216 function ...
Jérémy Jean
doaj   +1 more source

Saturated Partial Embeddings of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley   +1 more source