A class of optimal authentication codes with secrecy

May 14, 2026 · Grace Period · + Add venue

⏳ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Haibo Liu, Chengzhi Wei, Qunying Liao arXiv ID 2605.14823 Category cs.IT: Information Theory Citations 0
Abstract
In this paper, a class of linear authentication codes with secrecy are constructed, which have simple encoding rules and are easy to implement. Based on the special Weil sum, the maximum success probabilities of substitution attack and impersonation attack are calculated, and these codes are proven to be asymptotically optimal with respect to certain bounds.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Information Theory