Article
Publicly Available
A class of hash functions based on the algebraic eraser™
-
Iris Anshel
and
Paul E. Gunnells
Published/Copyright:
April 12, 2016
Received: 2015-6-26
Published Online: 2016-4-12
Published in Print: 2016-5-1
© 2016 by De Gruyter
Articles in the same Issue
- Frontmatter
- A class of hash functions based on the algebraic eraser™
- Generic case complexity of the Graph Isomorphism Problem
- Thompson's group F is 1-counter graph automatic
- The automorphism group of a finitely generated virtually abelian group
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Faster Ate pairing computation on Selmer's model of elliptic curves
- A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
- Memory-saving computation of the pairing final exponentiation on BN curves
Keywords for this article
Algebraic eraser;
colored Burau key agreement protocol;
group theoretic cryptography;
braid groups;
hash functions
Articles in the same Issue
- Frontmatter
- A class of hash functions based on the algebraic eraser™
- Generic case complexity of the Graph Isomorphism Problem
- Thompson's group F is 1-counter graph automatic
- The automorphism group of a finitely generated virtually abelian group
- Factoring multi-power RSA moduli with primes sharing least or most significant bits
- Faster Ate pairing computation on Selmer's model of elliptic curves
- A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
- Memory-saving computation of the pairing final exponentiation on BN curves
