\(\mathrm{SL}_2\) homomorphic hash functions: worst case to average case reduction and short collision search

DOI10.1007/S10623-015-0129-8zbMath1379.94045arXiv1306.5646OpenAlexW1473762019WikidataQ123197623 ScholiaQ123197623MaRDI QIDQ306055

Ciaran Mullan, Boaz Tsaban

Publication date: 31 August 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5646

zbMATH Keywords

expander graphs\(\mathrm{SL}_2\) hashCayley hash functionhomomorphic hash functionTillich-Zémor hash

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40) Cryptography (94A60)

Related Items (5)

Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing ⋮ More secure version of a Cayley hash function ⋮ Compositions of linear functions and applications to hashing ⋮ New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\) ⋮ Ironwood meta key agreement and authentication protocol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expansion in finite simple groups of Lie type.
• Strong uniform expansion in \(\text{SL}(2,p)\).
• Cryptographic hash functions from expander graphs
• Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
• Uniform expansion bounds for Cayley graphs of \(\text{SL}_2(\mathbb F_p)\).
• Cryptanalysis of the Tillich-Zémor hash function
• Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\)
• Expander graphs in pure and applied mathematics
• Rubik’s for Cryptographers
• Expander graphs and their applications
• Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
• On the Security of the Hashing Scheme Based on SL 2
• Computational Complexity

This page was built for publication: \(\mathrm{SL}_2\) homomorphic hash functions: worst case to average case reduction and short collision search