An identification system based on the explicit isomorphism problem
Rings and Algebras
2021-09-20 v3 Cryptography and Security
Abstract
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.
Cite
@article{arxiv.1812.09130,
title = {An identification system based on the explicit isomorphism problem},
author = {Sándor Z. Kiss and Péter Kutas},
journal= {arXiv preprint arXiv:1812.09130},
year = {2021}
}
Comments
accepted to Applicable Algebra in Engineering, Communication and Computing