Switchings of semifield multiplications

Download

index.pdf

Date

2016-08-01

Author

Hou, Xiang-dong
Özbudak, Ferruh
ZHOU, Yue

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

196
views

71
downloads

Let B(X, Y) be a polynomial over F-qn which defines an F-q-bilinear form on the vector space F-qn, and let xi be a nonzero element in F-qn. In this paper, we consider for which B(X, Y), the binary operation xy + B(x, y) xi defines a (pre)semifield multiplication on F-qn. We prove that this question is equivalent to finding q-linearized polynomials L(X) is an element of F-qn [X] such that Tr-qn/q (L(x)/x) not equal 0 for all x is an element of F-qn*. For n <= 4, we present several families of L(X) and we investigate the derived (pre) semifields. When q equals a prime p, we show that if n > 1/2(p - 1)(p(2) - p + 4), L(X) must be a(0)X for some a(0) is an element of F-pn satisfying Tr-qn/q (a(0)) not equal 0. Finally, we include a natural connection with certain cyclic codes over finite fields, and we apply the Hasse-Weil-Serre bound for algebraic curves to prove several necessary conditions for such kind of L(X).

Subject Keywords

Cyclic codes, Finite field, Linearized polynomial, Semifield, The Hasse-Weil-Serre bound

URI

https://hdl.handle.net/11511/39701

Journal

DESIGNS CODES AND CRYPTOGRAPHY

DOI

https://doi.org/10.1007/s10623-015-0081-7

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Multidimensional cyclic codes and Artin–Schreier type hypersurfaces over finite fields Güneri, Cem; Özbudak, Ferruh (Elsevier BV, 2008-1) We obtain a trace representation for multidimensional cyclic codes via Delsarte's theorem. This relates the weights of the codewords to the number of affine rational points of Artin-Schreier type hypersurfaces over finite fields. Using Deligne's and Hasse-Weil-Serre inequalities we get bounds on the minimum distance. Comparison of the bounds is made and illustrated by examples. Some applications of our results are given. We obtain a bound on certain character sums over F-2 which gives better estimates than ...
Additive polynomials and primitive roots over finite fields Özbudak, Ferruh (2001-01-01) We prove existence of primitive roots with a prescribed nonzero image using the arithmetic of algebraic function fields for a class of polynomials over sufficiently large finite fields.
Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes Koese, Seyda; Özbudak, Ferruh (2022-03-01) We determine the unique factorization of some polynomials over a finite local commutative ring with identity explicitly. This solves and generalizes the main conjecture of Qian, Shi and Sole in [13]. We also give some applications to enumeration of certain generalized double circulant self-dual and linear complementary dual (LCD) codes over some finite rings together with an application in asymptotic coding theory.
Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products Cenk, Murat; Hasan, M. Anwar (2013-07-01) In this paper, we consider three-way split formulas for binary polynomial multiplication and Toeplitz matrix vector product (TMVP). We first recall the best known three-way split formulas for polynomial multiplication: the formulas with six recursive multiplications given by Sunar in a 2006 IEEE Transactions on Computers paper and the formula with five recursive multiplications proposed by Bernstein at CRYPTO 2009. Second, we propose a new set of three-way split formulas for polynomial multiplication that a...
A note on the minimal polynomial of the product of linear recurring sequences Cakcak, E (1999-08-06) Let F be a field of nonzero characteristic, with its algebraic closure, F. For positive integers a, b, let J(a, b) be the set of integers k, such that (x - 1)k is the minimal polynomial of the termwise product of linear recurring sequences sigma and tau in F ($) over bar, with minimal polynomials (x - 1)(a) and (x - 1)(b) respectively. This set plays a crucial role in the determination of the product of linear recurring sequences with arbitrary minimal polynomials. Here, we give an explicit formula to deter...

Citation Formats

X.-d. Hou, F. Özbudak, and Y. ZHOU, “Switchings of semifield multiplications,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 217–239, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39701.