Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography

DOI10.1007/978-3-540-68914-0_9zbMath1319.94058OpenAlexW44503990MaRDI QIDQ3506407

Søren S. Thomsen, Ivan B. Damgård, Lars R. Knudsen

Publication date: 13 June 2008

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68914-0_9

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptographic hash functions from expander graphs
• Modular Multiplication Without Trial Division
• SWIFFT: A Modest Proposal for FFT Hashing
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of MD4
• Advances in Cryptology – CRYPTO 2004
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Collisions of SHA-0 and Reduced SHA-1
• Finding Collisions in the Full SHA-1
• One Way Hash Functions and DES

This page was built for publication: Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography