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

DOI10.1515/GCC-2019-2001zbMath1434.94075OpenAlexW2936727315WikidataQ128038988 ScholiaQ128038988MaRDI QIDQ2304868

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Compositions of linear functions and applications to hashing
• Cryptanalysis of the Tillich-Zémor hash function
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

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