New methods of construction of cartesian authentication codes from geometries over finite commutative rings
In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of successful impersonation attack and substitution attac...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2018-09-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2017-0057 |