Proof of Correspondence between Keys and Encoding Maps in an Authentication Code
March 23, 2017 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Juan Carlos Ku-Cauich, Guillermo Morales-Luna, Horacio Tapia-Recillas
arXiv ID
1703.08147
Category
math.NT
Cross-listed
cs.IT
Citations
1
Venue
arXiv.org
Last Checked
1 month ago
Abstract
In a former paper the authors introduced two new systematic authentication codes based on the Gray map over a Galois ring. In this paper, it is proved the one-to-one onto correspondence between keys and encoding maps for the second introduced authentication code.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.NT
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
An analogue of Vosper's Theorem for Extension Fields
R.I.P.
π»
Ghosted
Improved torsion point attacks on SIDH variants
R.I.P.
π»
Ghosted
Ramanujan graphs in cryptography
R.I.P.
π»
Ghosted
Locally Recoverable Codes with Availability $t\geq 2$ from Fiber Products of Curves
R.I.P.
π»
Ghosted
Failing to hash into supersingular isogeny graphs
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted