On time-space lower bounds for finding short collisions in sponge hash functions

DOI10.1007/978-3-031-48621-0_9MaRDI QIDQ6582219zbMATH OpenFDO

Authors Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48621-0_9

zbMATH Keywords

auxiliary inputcollisionhash functionsmulti-instancepre-computationsponge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Post-quantum security of the sponge construction
• Beyond conventional security in sponge-based authenticated encryption modes
• Tight time-space lower bounds for finding multiple collision pairs and their applications

Cites work

• A cryptanalytic time-memory trade-off
• Constructive proofs of concentration bounds
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 7788481 (Why is no real title available?)
• Lower bounds on the time/memory tradeoff of function inversion
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• On the Indifferentiability of the Sponge Construction
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
• Random oracles and non-uniformity
• Revisiting time-space tradeoffs for function inversion
• The Discrete Logarithm problem with preprocessing
• The function-inversion problem: barriers and opportunities
• The query-complexity of preprocessing attacks
• Time space tradeoffs for attacks against one-way functions and PRGs
• Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions

Cited in

(5)

• Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
• Quantum one-wayness of the single-round sponge with invertible permutations
• Time-space tradeoffs for finding multi-collisions in Merkle-Damgård hash functions
• Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
• The order of hashing in Fiat-Shamir schemes

This page was built for publication: On time-space lower bounds for finding short collisions in sponge hash functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582219)