Double-block-length hash function for minimum memory size
From MaRDI portal
Publication:6157555
DOI10.1007/978-3-030-92078-4_13zbMATH Open1514.94120OpenAlexW3215442144MaRDI QIDQ6157555FDOQ6157555
Authors: Yusuke Naito, Yu Sasaki, Takeshi Sugawara
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_13
Recommendations
indifferentiabilitycollision resistancelightweight cryptographytweakable block cipherdouble-block-length hashlow memory
Cites Work
- Title not available (Why is that?)
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- Theory of Cryptography
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- One Way Hash Functions and DES
- Title not available (Why is that?)
- MJH: a faster alternative to MDC-2
- Some Plausible Constructions of Double-Block-Length Hash Functions
- Another glance at double-length hashing
- The collision security of Tandem-DM in the ideal cipher model
- Hash Functions and RFID Tags: Mind the Gap
- The preimage security of double-block-length compression functions
- Optimal collision security in double block length hashing with single length key
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Duplexing the sponge: Single-pass authenticated encryption and other applications
- Pushing the limits: a very compact and a threshold implementation of AES
- Indifferentiability of double-block-length hash function without feed-forward operations
- Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
- Lightweight authenticated encryption mode suitable for threshold implementation
Cited In (1)
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)