The following pages link to (Q2778848):
Displaying 15 items.
- A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\) (Q285901) (← links)
- The hash function \texttt{BLAKE} (Q483134) (← links)
- Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724) (← links)
- Construction of universal one-way hash functions: tree hashing revisited (Q2384401) (← links)
- Parameterized hash functions (Q2443014) (← links)
- Higher order eTCR hash functions (Q2629411) (← links)
- Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
- (Q3191600) (← links)
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? (Q3506390) (← links)
- The Grindahl Hash Functions (Q3524880) (← links)
- How to Fill Up Merkle-Damgård Hash Functions (Q3600380) (← links)
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders (Q3634491) (← links)
- How to Build a Hash Function from Any Collision-Resistant Function (Q5387097) (← links)
- Merkle-Damgård Revisited: How to Construct a Hash Function (Q5451041) (← links)
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction (Q5757689) (← links)
