Construction of secure and fast hash functions using nonbinary error-correcting codes
From MaRDI portal
Publication:4677572
DOI10.1109/TIT.2002.801402zbMATH Open1062.94040OpenAlexW2100762331WikidataQ56933273 ScholiaQ56933273MaRDI QIDQ4677572FDOQ4677572
Authors: Bart Preneel, Lars R. Knudsen 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2002.801402
Recommendations
- scientific article; zbMATH DE number 1088255
- New Constructions for Secure Hash Functions
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
- Using random error correcting codes in near-collision attacks on generic hash-functions
- scientific article; zbMATH DE number 4132087
- scientific article; zbMATH DE number 1440070
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- A new practical algorithm for the construction of a perfect hash function
- Efficient software implementations of code-based hash functions and stream-ciphers
Cited In (11)
- New Constructions for Secure Hash Functions
- One-way hash function based on delay-induced hyperchaos
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Progress in Cryptology – Mycrypt 2005
- Title not available (Why is that?)
- A provably secure non-iterative hash function resisting birthday attack
- Collision attacks against the Knudsen-Preneel compression functions
- Open problems in hash function security
- Recursive constructions of secure codes and hash families using difference function families.
This page was built for publication: Construction of secure and fast hash functions using nonbinary error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677572)
