Security of truncated permutation without initial value

DOI10.1007/978-3-031-22966-4_21MaRDI QIDQ6132428zbMATH OpenOpenAlexFDO

Authors Lorenzo Grassi, Bart Mennink

Publication date 16 August 2023

Published in Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22966-4_21

zbMATH Keywords

digest generationindifferentiabilityMGFrandom permutationtruncation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)

Recommendations

• On the Indifferentiability of the Sponge Construction
• Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
• A simple variant of the Merkle-Damgård scheme with a permutation
• Linking Stam's bounds with generalized truncation

Cites work

• An analysis of the blockcipher-based hash functions from PGV
• BLAKE2: simpler, smaller, fast as MD5
• Block-cipher-based tree hashing
• Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 3877077 (Why is no real title available?)
• scientific article; zbMATH DE number 1024070 (Why is no real title available?)
• Indifferentiability beyond the birthday bound for the xor of two public random permutations
• Indifferentiability of double length compression functions
• Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
• Indifferentiability of the Sum of Random Permutations Toward Optimal Security
• Indifferentiability of truncated random permutations
• Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
• Information-theoretic indistinguishability via the chi-squared method
• Keccak
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the Indifferentiability of the Sponge Construction
• On the XOR of multiple random permutations
• Optimal collision security in double block length hashing with single length key
• Security of truncated permutation without initial value
• The Grindahl Hash Functions
• Theory of Cryptography

Cited in

(5)

• The summation-truncation hybrid: reusing discarded bits for free
• Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
• On the Indifferentiability of the Sponge Construction
• Security of truncated permutation without initial value
• Generic security of the SAFE API and its applications

This page was built for publication: Security of truncated permutation without initial value

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