Cryptanalysis of a Cayley hash function based on affine maps in one variable over a finite field
From MaRDI portal
Publication:6564022
DOI10.1007/S44007-024-00109-XzbMATH Open1542.9414MaRDI QIDQ6564022FDOQ6564022
Authors: Bianca Sosnovski 
Publication date: 28 June 2024
Published in: La Matematica (Search for Journal in Brave)
Recommendations
- Classical proofs for the quantum collapsing property of classical hash functions
- Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions
- Cryptanalysis of hash functions on the MD4-family.
- Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing
- SPN-Hash: Improving the Provable Resistance against Differential Collision Attacks
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- Cryptographic hash functions from expander graphs
- Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing
- Cryptanalysis of the Tillich-Zémor hash function
- Rubik’s for Cryptographers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Full Cryptanalysis of LPS and Morgenstern Hash Functions
- Preimages for the Tillich-Zémor hash function
- Compositions of linear functions and applications to hashing
- Title not available (Why is that?)
- Introduction to post-quantum cryptography
- Cryptographic hash functions from sequences of lifted Paley graphs
- More secure version of a Cayley hash function
- New Zémor-Tillich type hash functions over \(\mathrm{GL}_2 (\mathbb{F}_{p^n})\)
- Cryptanalysis of a hash function, and the modular subset sum problem
This page was built for publication: Cryptanalysis of a Cayley hash function based on affine maps in one variable over a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564022)
