Provably Good Codes for Hash Function Design

DOI10.1007/978-3-540-74462-7_26MaRDI QIDQ5429172zbMATH OpenOpenAlexFDO

Authors Anindya C. Patthak, C. S. Jutla

Publication date 29 November 2007

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74462-7_26

zbMATH Keywords

collision-resistant hash functionslinear codesminimum distanceSHA-1

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes
• Cryptography and Coding
• scientific article; zbMATH DE number 1088255
• scientific article; zbMATH DE number 1759316
• scientific article; zbMATH DE number 1942817

Cited in

(3)

• scientific article; zbMATH DE number 4132087 (Why is no real title available?)
• Security analysis of SIMD
• scientific article; zbMATH DE number 1498827 (Why is no real title available?)

This page was built for publication: Provably Good Codes for Hash Function Design

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