Results 111 to 120 of about 2,222 (156)
Preimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in [PDF]
paper) was suggested by Lyubashevsky et al.. in Second Hash Workshop in Aug. 2006. This paper shows preimage attacks on hash functions based on three modes of FFT-Hash.
Donghoon Chang
core
New Preimage Attack on MDC-4 [PDF]
In this paper, we provide some cryptanalytic results for double-block-length (DBL) hash modes of block ciphers, MDC-4. Our preimage attacks follow the framework of Knudsen et al.\u27s time/memory trade-off preimage attack on MDC-2.
Deukjo Hong, Daesung Kwon
core
Genus and the Lyusternik-Schnirelmann category of preimages
In this paper some axiomatic generalization (function of open subsets) of the relative Lyusternik - Schnirelmann category is considered. For this function and a given map of the underlying space to a finite polyhedron some lower bounds on the value of ...
R. N. Karasev
doaj
The Preimage of Rectifier Network Activities.
QC ...
Carlsson, Stefan +4 more
openaire +2 more sources
A novel SAT all-solutions solver for efficient preimage computation
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (2) a marked CNF database non-trivially combining success/conflict-driven ...
Sheng, Shuo +5 more
core
Characterizing derivatives by preimages of sets
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Digital Plane Preimage Structure [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Coeurjolly
exaly +7 more sources
The Preimage Security of Double-Block-Length Compression Functions
We present new techniques for deriving preimage resistance bounds for block cipher based double-block-length, double-call hash functions.
Jooyoung Lee +2 more
exaly +2 more sources
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners [PDF]
This paper studies functional-graph-based (second) preimage attacks against hash combiners. By exploiting more properties of cyclic nodes of functional graph, we find an improved preimage attack against the XOR combiner with a complexity of $2^{5n/8 ...
Jian Guo, Dawu Gu, Zhenzhen Bao
exaly +2 more sources

