A New Construction of Multi-receiver Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields

TL;DR

This paper introduces a novel method for constructing multi-receiver authentication codes using pseudo-symplectic geometry over finite fields, providing explicit parameters and deception probabilities.

Contribution

It presents a new geometric construction of multi-receiver authentication codes, expanding the toolkit for secure communication protocols.

Findings

Constructed authentication codes with specific parameters

Calculated probabilities of deception for the codes

Demonstrated the effectiveness of geometric methods in cryptography

Abstract

Multi-receiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we constructed one multi-receiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of this codes are also computed.