A class of hash functions based on the Algebraic Eraser^TM
From MaRDI portal
Publication:285901
DOI10.1515/GCC-2016-0004zbMATH Open1382.94048OpenAlexW2340779799MaRDI QIDQ285901FDOQ285901
Authors: Derek Atkins, Dorian Goldfeld, Paul E. Gunnells, Iris Anshel
Publication date: 19 May 2016
Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/gcc-2016-0004
Recommendations
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- An algebraic approach to Cichelli's perfect hashing
- A new practical algorithm for the construction of a perfect hash function
- A combinatorial characterization of certain universal classes of hash functions
- On Universal Classes of Extremely Random Constant-Time Hash Functions
- On a family of universal hash functions
- Applications of hashing in algebraic manipulation (an annotated bibliography)
- ERINDALE: A Polynomial Based Hashing Algorithm
- scientific article; zbMATH DE number 1722677
- A note on the hash function of Tillich and Zémor
algebraic eraserbraid groupscolored Burau key agreement protocolgroup theoretic cryptographyhash functions
Cites Work
Cited In (5)
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- A practical cryptanalysis of the Algebraic Eraser
- Ironwood meta key agreement and authentication protocol
- A unique key sharing protocol among three users using non-commutative group for electronic health record system
- Applications of hashing in algebraic manipulation (an annotated bibliography)
This page was built for publication: A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285901)