Cryptanalysis of a hash function, and the modular subset sum problem

DOI10.1515/GCC-2019-2001MaRDI QIDQ2304868zbMATH OpenOpenAlexWikidataFDO

Authors Chris Monico

Publication date 13 March 2020

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gcc-2019-2001

zbMATH Keywords

cryptanalysisCayley hash functionsubset-sum problem

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60)

Recommendations

• Cryptanalysis of a Hash Function Proposed at ICISC 2006
• Cryptanalysis of the Tillich-Zémor hash function
• scientific article; zbMATH DE number 1456817
• Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
• scientific article; zbMATH DE number 1024104

Cites work

• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1406765 (Why is no real title available?)
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Compositions of linear functions and applications to hashing
• Cryptanalysis of the Tillich-Zémor hash function

Cited in

(4)

• On subset-resilient hash function families
• Cryptanalysis of a Hash Function Proposed at ICISC 2006
• Cryptanalysis of a Cayley hash function based on affine maps in one variable over a finite field
• Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes

This page was built for publication: Cryptanalysis of a hash function, and the modular subset sum problem

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