A class of optimal authentication codes with secrecy
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916012678447104 |
|---|---|
| author | Liu, Haibo Wei, Chengzhi Liao, Qunying |
| author_facet | Liu, Haibo Wei, Chengzhi Liao, Qunying |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_14823 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A class of optimal authentication codes with secrecy Liu, Haibo Wei, Chengzhi Liao, Qunying Information Theory 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. |
| title | A class of optimal authentication codes with secrecy |
| topic | Information Theory |
| url | https://arxiv.org/abs/2605.14823 |