scholarly journals A New Construction of Multisender Authentication Codes from Polynomials over Finite Fields

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Xiuli Wang
Keyword(s):  
Finite Fields ◽  
Authentication Codes ◽  
Authentication Code ◽  
Polynomials Over Finite Fields ◽  
New Construction

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

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

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Xiuli Wang
Keyword(s):  
Finite Fields ◽  
Authentication Codes ◽  
Authentication Code ◽  
New Construction

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.

scholarly journals Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry

2011 ◽  
Vol 2011 ◽  
pp. 1-18
Author(s):  
You Gao ◽  
Huafeng Yu
Keyword(s):  
Probability Distribution ◽  
Finite Fields ◽  
Symplectic Geometry ◽  
Authentication Codes ◽  
Uniform Probability ◽  
Different Types ◽  
Uniform Probability Distribution ◽  
New Construction

A new construction of authentication codes with arbitration and multireceiver from singular symplectic geometry over finite fields is given. The parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of deception are also computed.

Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields

2013 ◽  
Vol 20 (04) ◽  
pp. 701-710 ◽  
Author(s):  
Shangdi Chen ◽  
Dawei Zhao
Keyword(s):  
Finite Fields ◽  
Symplectic Geometry ◽  
Key Distribution ◽  
Authentication Codes ◽  
Authentication Code ◽  
Message Transmission ◽  
Basic Model ◽  
Distribution Phase

As an extension of the basic model of MRA-codes, multi-receiver multi-fold authentication codes can use a single key distribution phase for multiple message transmission. A multi-receiver multi-fold authentication code is constructed from the singular symplectic geometry over finite fields in this paper. The parameters and probabilities of success in impersonation and substitution attacks by malicious groups of receivers of this code are computed.

Some primitive polynomials over finite fields

2001 ◽  
Vol 21 (3) ◽  
pp. 412-416 ◽  
Author(s):  
Seunghwan Chang ◽  
June Bok Lee
Keyword(s):  
Finite Fields ◽  
Primitive Polynomials ◽  
Polynomials Over Finite Fields

scholarly journals Factorization of a class of polynomials over finite fields

2012 ◽  
Vol 18 (1) ◽  
pp. 108-122 ◽  
Author(s):  
Henning Stichtenoth ◽  
Alev Topuzoğlu
Keyword(s):  
Finite Fields ◽  
Polynomials Over Finite Fields

scholarly journals Value sets of polynomials over finite fields

1993 ◽  
Vol 119 (3) ◽  
pp. 711-711 ◽  
Author(s):  
Da Qing Wan ◽  
Peter Jau-Shyong Shiue ◽  
Ching Shyang Chen
Keyword(s):  
Finite Fields ◽  
Polynomials Over Finite Fields ◽  
Value Sets
Sign in / Sign up

Export Citation Format

Share Document