An identification system based on the explicit isomorphism problem
This work addresses security in identification systems for cryptography, but it appears incremental as it generalizes an existing protocol.
The authors tackled the problem of designing a secure identification system by proposing a new protocol based on the hardness of computing isomorphisms between orders in division algebras, generalizing a prior protocol that relied on integral equivalence of quadratic forms.
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.