A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields | Zendy

Shangdi Chen | Zendy; Yang Chun-li | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields

Author(s) -

Shangdi Chen,

Yang Chun-li

Publication year - 2014

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2014/102301

Subject(s) - construct (python library) , symplectic geometry , authentication (law) , finite field , computer science , mathematics , algebra over a field , theoretical computer science , algorithm , geometry , discrete mathematics , pure mathematics , computer security , computer network

Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message. In this paper, we construct multisender authentication codes with sequential model from symplectic geometry over finite fields, and the parameters and the maximum probabilities of deceptions are also calculated

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research