Brute force attacks on hash functions

DOI10.1080/09720529.2007.10698131MaRDI QIDQ5421207zbMATH OpenOpenAlexFDO

Authors

Publication date 22 October 2007

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2007.10698131

zbMATH Keywords

brute force attackshash functionsresistance

Mathematics Subject Classification ID

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

Recommendations

• Some observations on the theory of cryptographic hash functions
• Fast Software Encryption
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Cryptographic hash functions: theory and practice
• Herding Hash Functions and the Nostradamus Attack

Cites work

• A Mathematical Theory of Communication
• Foundations of Cryptography
• scientific article; zbMATH DE number 3458034 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 854547 (Why is no real title available?)
• Inequalities: theory of majorization and its applications

Cited in

(5)

• Challenging the increased resistance of regular hash functions against birthday attacks
• Notes on a preimage-resistant hash function
• Advances in Cryptology - EUROCRYPT 2004
• Breaking a New Hash Function Design Strategy Called SMASH
• An attack on hash function HAVAL-128

This page was built for publication: Brute force attacks on hash functions

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