A provably secure non-iterative hash function resisting birthday attack

DOI10.1016/J.TCS.2016.02.023zbMATH Open1371.94657OpenAlexW2285957840WikidataQ120900609 ScholiaQ120900609MaRDI QIDQ344781FDOQ344781

Authors: Shenghui Su, Tao Xie, Shuwang Lü 

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

Recommendations

• A new non-Merkle-Damgård structural hash function with provable security
• scientific article; zbMATH DE number 1500485
• scientific article; zbMATH DE number 1024071
• scientific article; zbMATH DE number 503327
• Construction of secure and fast hash functions using nonbinary error-correcting codes

zbMATH Keywords

birthday attackhash functionprovable securitycompression algorithmmeet-in-the-middle attacknon-iterative structure

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• A new non-Merkle-Damgård structural hash function with provable security

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

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