Perfect message authentication codes are robust to small deviations from uniform key distributions
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916896370065408 |
|---|---|
| author | Ryabko, Boris |
| author_facet | Ryabko, Boris |
| contents | We investigate the impact of (possible) deviations of the probability distribution of key values from a uniform distribution for the information-theoretic strong, or perfect, message authentication code. We found a simple expression for the decrease in security as a function of the statistical distance between the real key probability distribution and the uniform one. In a sense, a perfect message authentication code is robust to small deviations from a uniform key distribution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_09783 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Perfect message authentication codes are robust to small deviations from uniform key distributions Ryabko, Boris Cryptography and Security 94A60 Cryptography E.3 We investigate the impact of (possible) deviations of the probability distribution of key values from a uniform distribution for the information-theoretic strong, or perfect, message authentication code. We found a simple expression for the decrease in security as a function of the statistical distance between the real key probability distribution and the uniform one. In a sense, a perfect message authentication code is robust to small deviations from a uniform key distribution. |
| title | Perfect message authentication codes are robust to small deviations from uniform key distributions |
| topic | Cryptography and Security 94A60 Cryptography E.3 |
| url | https://arxiv.org/abs/2508.09783 |