Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
about
Building indifferentiable compression functions from the PGV compression functionsSecurity Analysis of Randomize-Hash-then-Sign Digital SignaturesThe suffix-free-prefix-free hash function construction and its indifferentiability security analysisCryptanalysis of MDC-2Herding Hash Functions and the Nostradamus Attack
P2860
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
description
artikull shkencor
@sq
artículu científicu
@ast
scholarly article
@en
wetenschappelijk artikel
@nl
գիտական հոդված
@hy
գիտական յօդուած
@hyw
name
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@ast
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@en
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@nl
type
label
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@ast
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@en
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@nl
prefLabel
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@ast
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@en
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@nl
P356
P1476
Second Preimages on n-Bit Hash Functions for Much Less than 2ⁿ Work
@en
P356
10.1007/11426639_28