Results 11 to 20 of about 2,222 (156)
Let K be a field of characteristic zero. Based on the degree estimate of Makar-Limanov and Yu, we prove that the preimage of a coordinate under an injective endomorphism of K〈x, y〉 is also a coordinate. As by-products, we give new proofs of the following results: (1) the preimage of a coordinate under an injective endomorphism of K[x,y] is also a ...
Gong, SJ, Yu, JT
openaire +5 more sources
The Second-Preimage Attack on MD4 [PDF]
In Eurocrypt’05, Wang et al. presented new techniques to find collisions of Hash function MD4. The techniques are not only efficient to search for collisions, but also applicable to explore the second- preimage of MD4. About the second-preimage attack, they showed that a random message was a weak message with probability 2−122 and it only needed a one ...
Hongbo Yu +3 more
core +4 more sources
Preimage Problem Inspired by the F-Transform
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 +2 more sources
Generalized preimage of conics
This paper focuses on the preimage of conics in dimension n. We use a parameter space to determine the Euclidean straight lines which cross the given pixel set. Those lines are gathered in the generalized preimage of the pixel set. To adapt this method to the Pythagorean model, based on the Euclidean distance d2, we propose the preimage for circles ...
Andres, Eric, Largeteau-Skapin, Gaëlle
core +5 more sources
Preimage homomorphism indices of preimage classes
Under finite regular covering spaces, each preimage class of the base spaces is covered by some preimage classes of the covering spaces. In this paper the authors find an explicit relationship between the preimage classes under finite regular covering spaces in terms of covering transformation groups.
Ha, Ku Yong, Lee, Jong Bum
openaire +2 more sources
Tight Preimage Resistance of the Sponge Construction [PDF]
The cryptographic sponge is a popular method for hash function design. The construction is in the ideal permutation model proven to be indifferentiable from a random oracle up to the birthday bound in the capacity of the sponge. This result in particular
Charlotte Lefevre, Bart Mennink
core +1 more source
Preimages under the Bubblesort Operator
We study preimages of permutations under the bubblesort operator $\mathbf{B}$. We achieve a description of these preimages much more complete than what is known for the more complicated sorting operators $\mathbf{S}$ (stacksort) and $\mathbf{Q}$ (queuesort).
Mathilde Bouvel +2 more
openaire +8 more sources
Preimages under the Queuesort algorithm [PDF]
18 ...
Cioni L., Ferrari L.
openaire +5 more sources
On preimages of ultrafilters in ZF [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Herrlich, Horst +2 more
openaire +2 more sources
Decisional second-preimage resistance: When does SPR imply PRE? [PDF]
There is a well-known gap between second-preimage resistance and preimage resistance for length-preserving hash functions. This paper introduces a simple concept that fills this gap.
Daniel J. Bernstein, Andreas Hülsing
core +2 more sources

