A New Construction of Multisender Authentication Codes from Pseudosymplectic Geometry over Finite Fields | Zendy

Xiuli Wang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Construction of Multisender Authentication Codes from Pseudosymplectic Geometry over Finite Fields

Author(s) -

Xiuli Wang

Publication year - 2013

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/2013/602539

Subject(s) - construct (python library) , authentication (law) , code (set theory) , finite field , computer science , message authentication code , theoretical computer science , algorithm , computer security , mathematics , computer network , discrete mathematics , programming language , cryptography , set (abstract data type)

Multisender authentication codes allow a group of senders to construct an authenticated message for one receiver such that the receiver can verify authenticity of the received message. In this paper, we construct one multisender authentication code from pseudosymplectic geometry over finite fields. The parameters and the probabilities of deceptions of this code are also computed

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