Anshel–Anshel–Goldfeld key exchange

Anshel–Anshel–Goldfeld protocol, also known as a commutator key exchange, is a key-exchange protocol using nonabelian groups. It was invented by Drs. Michael Anshel, Iris Anshel, and Dorian Goldfeld. Unlike other group-based protocols, it does not employ any commuting or commutative subgroups of a given platform group and can use any nonabelian group with efficiently computable normal forms. It is often discussed specifically in application of braid groups, which notably are infinite (and the group elements can take variable quantities of space to represent). The computed shared secret is an element of the group, so in practice this scheme must be accompanied with a sufficiently secure compressive hash function to normalize the group element to a usable bitstring.

Description

Let $G$ be a fixed nonabelian group called a platform group.

Alice's public/private information:

• Alice's public key is a tuple of elements ${\bf {a}}=(a_{1},\ldots ,a_{n})$ in $G$.
• Alice's private key is a sequence of elements from ${\bf {a}}$ and their inverses: $a_{i_{1}}^{\varepsilon _{1}},\ldots ,a_{i_{L}}^{\varepsilon _{L}}$, where $a_{i_{k}}\in {\bf {a}}$ and $\varepsilon _{k}=\pm 1$. Based on that sequence she computes the product $A=a_{i_{1}}^{\varepsilon _{1}}\ldots a_{i_{L}}^{\varepsilon _{L}}$.

Bob's public/private information:

• Bob's public key is a tuple of elements ${\bf {b}}=(b_{1},\ldots ,b_{n})$ in $G$.
• Bob's private key is a sequence of elements from ${\bf {b}}$ and their inverses: $b_{j_{1}}^{\delta _{1}},\ldots ,b_{j_{L}}^{\delta _{L}}$, where $b_{j_{k}}\in {\bf {b}}$ and $\delta _{k}=\pm 1$. Based on that sequence he computes the product $B=b_{j_{1}}^{\delta _{1}}\ldots b_{j_{L}}^{\delta _{L}}$.

Transitions:

• Alice sends a tuple ${\overline {\bf {a}}}=(A^{-1}b_{1}A,\ldots ,A^{-1}b_{n}A)$ to Bob.
• Bob sends a tuple ${\overline {\bf {b}}}=(B^{-1}a_{1}B,\ldots ,B^{-1}a_{n}B)$ to Alice.

Shared key:

The key shared by Alice and Bob is the group element $K=A^{-1}B^{-1}AB\in G$ called the commutator of $A$ and $B$.

• Alice computes $K$ as a product $A^{-1}\cdot \left(B^{-1}a_{i_{1}}^{\varepsilon _{1}}B\right)\cdots \left(B^{-1}a_{i_{L}}^{\varepsilon _{L}}B\right)=A^{-1}B^{-1}AB$.
• Bob computes $K$ as a product $\left(A^{-1}b_{j_{L}}^{-\delta _{L}}A\right)\cdots \left(A^{-1}b_{j_{1}}^{-\delta _{1}}A^{}\right)\cdot B=A^{-1}B^{-1}AB$.

Security

From the standpoint of an attacker trying to attack the protocol, they usually learn the public keys ${\bf {a}}$ and ${\bf {b}}$, and the conjugated public keys ${\overline {\bf {a}}}$ and ${\overline {\bf {b}}}$. A direct attack then consists of trying to find a suitable $A$ that is generated by the elements of ${\bf {a}}$, and that produces the appropriate conjugations ${\overline {\bf {a}}}$ when applied. (An 'indirect' attack would consist of trying to find $K$ directly, which would require some additional special structure of the group.) For this reason the public keys ${\bf {a}}$ and ${\bf {b}}$ must be chosen to generate a large subgroup of $G$ — ideally, they form a full set of generators, so that $A$ cannot be constrained just by knowing that is generated from ${\bf {a}}$.

Solving for a suitable $A$ given the conjugation relations is called the conjugation problem, and substantial research has been done on attacks to the conjugacy problem on braid groups, although no full efficient solution has achieved.

See also

• Algebraic Eraser
• Group-based cryptography

References

• Anshel, I.; Anshel, M.; Goldfeld, D. (1999). "An algebraic method for public-key cryptography" (PDF). Math. Res. Lett. 6 (3): 287–291. CiteSeerX 10.1.1.25.8355. doi:10.4310/MRL.1999.v6.n3.a3.

Further reading

• Baev, D., et al. (2021). "Modification of Anshel-Anshel-Goldfeld Postquantum Algorithm / Protocol Based on Algebraic Braid Groups, in Order to the Span–Cyberattack Neutralization", J. Phys.: Conf. Ser. 2131 022079. 2021.

External links

• Michael Anshel's website