Double-block-length hash function for minimum memory size
From MaRDI portal
Publication:6157555
Recommendations
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- Another glance at double-length hashing
- Duplexing the sponge: Single-pass authenticated encryption and other applications
- Hash Functions and RFID Tags: Mind the Gap
- Indifferentiability of double-block-length hash function without feed-forward operations
- Lightweight authenticated encryption mode suitable for threshold implementation
- MJH: a faster alternative to MDC-2
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- One Way Hash Functions and DES
- Optimal collision security in double block length hashing with single length key
- Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
- Pushing the limits: a very compact and a threshold implementation of AES
- Some Plausible Constructions of Double-Block-Length Hash Functions
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- The collision security of Tandem-DM in the ideal cipher model
- The preimage security of double-block-length compression functions
- Theory of Cryptography
This page was built for publication: Double-block-length hash function for minimum memory size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157555)