Construction of authentication codes with distrust arbitration from polynomials over finite fields

2017 ◽  
Vol 24 (1) ◽  
pp. 87-95
Author(s):  
Chen Shangdi ◽  
Tian Wenjing ◽  
Li Xue
Keyword(s):  
Finite Fields ◽  
Authentication Codes ◽  
Polynomials Over Finite Fields

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.

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

scholarly journals Short Kloosterman Sums for Polynomials over Finite Fields

2003 ◽  
Vol 55 (2) ◽  
pp. 225-246 ◽  
Author(s):  
William D. Banks ◽  
Asma Harcharras ◽  
Igor E. Shparlinski
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Small Degree ◽  
Kloosterman Sums ◽  
Degree Relative ◽  
Irreducible Polynomials ◽  
Arbitrary Polynomial ◽  
Polynomials Over Finite Fields ◽  
Titchmarsh Theorem

AbstractWe extend to the setting of polynomials over a finite field certain estimates for short Kloosterman sums originally due to Karatsuba. Our estimates are then used to establish some uniformity of distribution results in the ring [x]/M(x) for collections of polynomials either of the form f−1g−1 or of the form f−1g−1 + afg, where f and g are polynomials coprime to M and of very small degree relative to M, and a is an arbitrary polynomial. We also give estimates for short Kloosterman sums where the summation runs over products of two irreducible polynomials of small degree. It is likely that this result can be used to give an improvement of the Brun-Titchmarsh theorem for polynomials over finite fields.

scholarly journals POLYNOMIALS OVER FINITE FIELDS WITH A GIVEN VALUE SET

2008 ◽  
Vol 12 (1) ◽  
pp. 245-253 ◽  
Author(s):  
Jiangmin Pan ◽  
Kar-ping Shum
Keyword(s):  
Finite Fields ◽  
Value Set ◽  
Polynomials Over Finite Fields
Sign in / Sign up

Export Citation Format

Share Document