An identification system based on the explicit isomorphism problem [article]

Sándor Z. Kiss, Péter Kutas
2021 arXiv   pre-print
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.
arXiv:1812.09130v3 fatcat:m7we5nsxtzbjzfdzua26xfm5pm