pith. sign in

arxiv: 1302.3160 · v3 · pith:GLBORIEGnew · submitted 2013-02-13 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords codesauthenticationmulti-receiverfieldsfinitegeometrymessagepseudo-symplectic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.