Design principles for dedicated hash functions

DOI10.1007/3-540-58108-1_10zbMATH Open0943.94524OpenAlexW1503405832MaRDI QIDQ4499397FDOQ4499397

Authors: Bart Preneel 

Publication date: 30 August 2000

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

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

Recommendations

• Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
• Combining Compression Functions and Block Cipher-Based Hash Functions
• Cryptographic hash functions: theory and practice
• Open problems in hash function security
• Looking Back at a New Hash Function

zbMATH Keywords

cryptographically secure compression functionsdedicated hash functions

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (11)

• Hashing with Polynomials
• Prepaid electronic cheques using public-key certificates
• Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
• An image encryption scheme with a pseudorandom permutation based on chaotic maps
• Find me a hash.
• Cryptanalysis of TWOPRIME
• Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
• Design of new XOR-based hash functions for cache memories
• Image encryption algorithm based on chaotic economic model
• A fast software one-way hash function
• Combining Compression Functions and Block Cipher-Based Hash Functions

Uses Software

• HAVAL

This page was built for publication: Design principles for dedicated hash functions

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