An identification system based on the explicit isomorphism problem
December 21, 2018 Β· Declared Dead Β· π Applicable Algebra in Engineering, Communication and Computing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
SΓ‘ndor Z. Kiss, PΓ©ter Kutas
arXiv ID
1812.09130
Category
math.RA
Cross-listed
cs.CR
Citations
0
Venue
Applicable Algebra in Engineering, Communication and Computing
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.RA
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Good Integers and Applications in Coding Theory
R.I.P.
π»
Ghosted
Generalized iterated-sums signatures
R.I.P.
π»
Ghosted
Tropical time series, iterated-sums signatures and quasisymmetric functions
R.I.P.
π»
Ghosted
Wajsberg algebras arising from binary block codes
R.I.P.
π»
Ghosted
Constacyclic and Quasi-Twisted Hermitian Self-Dual Codes over Finite Fields
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted