A provably secure non-iterative hash function resisting birthday attack

DOI10.1016/J.TCS.2016.02.023MaRDI QIDQ344781zbMATH OpenOpenAlexWikidataFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1722964 (Why is no real title available?)
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 4072862 (Why is no real title available?)
• scientific article; zbMATH DE number 176568 (Why is no real title available?)
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1862431 (Why is no real title available?)
• scientific article; zbMATH DE number 2123258 (Why is no real title available?)
• scientific article; zbMATH DE number 1418967 (Why is no real title available?)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A public key cryptosystem based on three new provable problems
• Advances in Cryptology - EUROCRYPT 2004
• Asymptotic granularity reduction and its application
• Collisions of SHA-0 and Reduced SHA-1
• Cryptanalysis of short RSA secret exponents
• Finding Collisions in the Full SHA-1
• Foundations of Cryptography
• Hiding information and signatures in trapdoor knapsacks
• Improved low-density subset sum algorithms
• One Way Hash Functions and DES
• SQUASH – A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags
• Solving low density knapsacks

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)