A provably secure non-iterative hash function resisting birthday attack

DOI10.1016/j.tcs.2016.02.023zbMath1371.94657OpenAlexW2285957840WikidataQ120900609 ScholiaQ120900609MaRDI QIDQ344781

Shenghui Su, Tao Xie, Lü, Shuwang

Publication date: 24 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.023

zbMATH Keywords

provable securityhash functionbirthday attackcompression algorithmmeet-in-the-middle attacknon-iterative structure

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• A public key cryptosystem based on three new provable problems
• Asymptotic granularity reduction and its application
• Improved low-density subset sum algorithms
• Cryptanalysis of short RSA secret exponents
• SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Foundations of Cryptography
• Solving Low Density Knapsacks
• Advances in Cryptology - EUROCRYPT 2004
• Collisions of SHA-0 and Reduced SHA-1
• Finding Collisions in the Full SHA-1
• Hiding information and signatures in trapdoor knapsacks
• One Way Hash Functions and DES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A provably secure non-iterative hash function resisting birthday attack