An identification system based on the explicit isomorphism problem
Keyword(s):
AbstractWe 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.
2009 ◽
Vol 178
(2)
◽
pp. 231-263
◽
1989 ◽
Vol 32
(1)
◽
pp. 139-145
Keyword(s):
Keyword(s):