Reference : Optimized Collision Search for STARK-Friendly Hash Challenge Candidates
E-prints/Working papers : First made available on ORBilu
Engineering, computing & technology : Computer science
Security, Reliability and Trust
Optimized Collision Search for STARK-Friendly Hash Challenge Candidates
Udovenko, Aleksei mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
[en] Symmetric cryptography ; Hash functions ; Cryptanalysis ; Multiparty Computation
[en] In this note, we report several solutions to the STARK-Friendly Hash Challenge: a competition with the goal of finding collisions for several hash functions designed specifically for zero-knowledge proofs (ZKP) and multiparty computations (MPC). We managed to find collisions for 3 instances of 91-bit hash functions. The method used is the classic parallel collision search with distinguished points from van Oorshot and Wiener (1994). As this is a general attack on hash functions, it does not exhibit any particular weakness of the chosen hash functions. The crucial part is to optimize the implementations to make the attack cost realistic, and we describe several arithmetic tricks.
University of Luxembourg: High Performance Computing - ULHPC
Fonds National de la Recherche - FnR
Researchers ; Professionals ; Students
FnR ; FNR11684537 > Alex Biryukov > FinCrypt > Security, Scalability, and Privacy in Blockchain Applications and Smart Contracts > 01/08/2018 > 31/07/2021 > 2017

File(s) associated to this reference

Fulltext file(s):

Open access
STARK_Friendly_Hash_Challenge.pdfAuthor preprint456.41 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.