  We propose a new identification system based on algorithmic problems related
to computing isomorphisms between central simple algebras. We design a
statistical zero knowledge protocol which relies on the hardness of computing
isomorphisms between orders in division algebras which generalizes a protocol
by Hartung and Schnorr, which relies on the hardness of integral equivalence of
quadratic forms.

Rings and Algebras;Cryptography and Security