A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\)

DOI10.1515/gcc-2016-0004zbMath1382.94048OpenAlexW2340779799MaRDI QIDQ285901

Paul E. Gunnells, Dorian Goldfeld, Derek Atkins, Iris Lee 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

zbMATH Keywords

braid groupshash functionsalgebraic erasercolored Burau key agreement protocolgroup theoretic cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Braid groups; Artin groups (20F36)

Related Items (3)

A unique key sharing protocol among three users using non-commutative group for electronic health record system ⋮ Short expressions of permutations as products and cryptanalysis of the algebraic eraser ⋮ Ironwood meta key agreement and authentication protocol

Cites Work

• A fast method for comparing braids
• A new approach to the word and conjugacy problems in the braid groups
• Zeta functions, one-way functions, and pseudorandom number generators.
• Unnamed Item

This page was built for publication: A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\)