CHAMP: Cayley HAshing with Matrix Products

Alexander Demin; Alexey Ovchinnikov; Vladimir Shpilrain

Paper 2026/2515

CHAMP: Cayley HAshing with Matrix Products

Alexander Demin, French National Centre for Scientific Research, Sorbonne University

Alexey Ovchinnikov, Queens College, CUNY, The Graduate Center, CUNY

Vladimir Shpilrain, The Graduate Center, CUNY

Abstract

Cayley hash functions hash binary strings by representing the bits of the message as elements of a semigroup and multiplying the corresponding elements. This gives Cayley hash functions useful homomorphic properties. Here, we propose CHAMP, a Cayley hash function based on products of $2\times 2$ matrices over a finite field, and discuss its security, implementation, and performance.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: Hash functions Cayley hashing Matrix semigroups Finite fields Collision resistance
Contact author(s): alexander demin @ lix polytechnique fr
aovchinnikov @ qc cuny edu
shpilrain @ yahoo com
History: 2026-10-17: approved; 2026-10-16: received; See all versions
Short URL: https://ia.cr/2026/2515
License: CC BY

BibTeX

@misc{cryptoeprint:2026/2515,
      author = {Alexander Demin and Alexey Ovchinnikov and Vladimir Shpilrain},
      title = {{CHAMP}: Cayley {HAshing} with Matrix Products},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2515},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2515}
}