New Constructions for Secure Hash Functions

DOI10.1007/3-540-69710-1_11MaRDI QIDQ4639447zbMATH OpenOpenAlexFDO

Authors Stuart Haber, Ramarathnam Venkatesan, William Aiello

Publication date 9 May 2018

Published in Fast Software Encryption (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-69710-1_11

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
• A new practical algorithm for the construction of a perfect hash function
• New hash functions and their use in authentication and set equality
• scientific article; zbMATH DE number 1676651
• New Universal Hash Functions
• scientific article; zbMATH DE number 177052
• A new non-Merkle-Damgård structural hash function with provable security
• Construction of secure and fast hash functions using nonbinary error-correcting codes
• Increasing the security of hash functions
• New Constructions of Universal Hash Functions Based on Function Sums

Cites work

• A fast software one-way hash function
• Collision-free hashing from lattice problems
• Cryptanalysis of MD4
• Fast hashing on the Pentium
• Foiling birthday attacks in length-doubling transformations
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 4057439 (Why is no real title available?)
• scientific article; zbMATH DE number 503244 (Why is no real title available?)
• scientific article; zbMATH DE number 503258 (Why is no real title available?)
• scientific article; zbMATH DE number 1024070 (Why is no real title available?)
• scientific article; zbMATH DE number 1088255 (Why is no real title available?)
• scientific article; zbMATH DE number 1455101 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• One Way Hash Functions and DES
• RIPEMD with two-round compress function is not collision-free
• RIPEMD-160: a strengthened version of RIPEMD
• The first two rounds of MD4 are not one-way
• Tiger: a fast new hash function

Cited in

(19)

• More secure version of a Cayley hash function
• Recursive constructions of secure codes and hash families using difference function families.
• Some observations on the theory of cryptographic hash functions
• New Universal Hash Functions
• Correlated-input secure hash functions
• On the collision and preimage resistance of certain two-call hash functions
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
• Amplifying Collision Resistance: A Complexity-Theoretic Treatment
• Salvaging Merkle-Damgård for Practical Applications
• scientific article; zbMATH DE number 1304288 (Why is no real title available?)
• scientific article; zbMATH DE number 1024038 (Why is no real title available?)
• scientific article; zbMATH DE number 1088254 (Why is no real title available?)
• Construction of secure and fast hash functions using nonbinary error-correcting codes
• ERINDALE: A Polynomial Based Hashing Algorithm
• Analysis of Multivariate Hash Functions
• Constructing an Ideal Hash Function from Weak Ideal Compression Functions
• Increasing the security of hash functions
• Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction

Describes a project that uses

Uses Software

• Tiger

This page was built for publication: New Constructions for Secure Hash Functions

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