×

Constructing commutative semifields of square order. (English) Zbl 1348.12005

Summary: The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [J. Bierbrauer, Des. Codes Cryptography 61, No. 2, 187–196 (2011; Zbl 1241.12004)]. We generalize this idea to a projection construction using two twisted semifields to construct semifields of odd characteristic. Planar functions and semifields have a strong connection, so this also constructs new planar functions.

MSC:

12K10 Semifields
51E15 Finite affine and projective planes (geometric aspects)

Citations:

Zbl 1241.12004

Software:

GAP
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] A. A. Albert, Quasigroups I,, Trans. Amer. Math. Soc., 54, 507 (1943) · Zbl 0063.00039 · doi:10.2307/1990259
[2] J. Bierbrauer, Commutative semifields from projection mappings,, Des. Codes Crypt., 61, 187 (2011) · Zbl 1241.12004 · doi:10.1007/s10623-010-9447-z
[3] A. Blokhuis, Permutations amongst the Dembowski-Ostrom polynomials,, in Finite Fields and Applications, 37 (2001) · Zbl 1009.11064 · doi:10.1007/978-3-642-56755-1_4
[4] L. Budaghyan, New commutative semifields defined by new PN multinomials,, Crypt. Commun., 3, 1 (2011) · Zbl 1291.12006 · doi:10.1007/s12095-010-0022-2
[5] L. Budaghyan, On isotopisms of commutative presemifields and CCZ-equivalence of functions,, Int. J. Found. Comput. Sci., 22, 1243 (2011) · Zbl 1245.94069 · doi:10.1142/S0129054111008684
[6] C. Carlet, Codes, bent functions and permutations suitable for DES-like cryptosystems,, Des. Codes Crypt., 15, 125 (1998) · Zbl 0938.94011 · doi:10.1023/A:1008344232130
[7] C. Carlet, Highly nonlinear mappings,, J. Complexity, 20, 205 (2004) · Zbl 1053.94011 · doi:10.1016/j.jco.2003.08.008
[8] R. S. Coulter, Commutative presemifields and semifields,, Adv. Math., 217, 282 (2008) · Zbl 1194.12007 · doi:10.1016/j.aim.2007.07.007
[9] R. S. Coulter, Planar functions and planes of Lenz-Barlotti class II,, Des. Codes Crypt., 10, 167 (1997) · Zbl 0872.51007 · doi:10.1023/A:1008292303803
[10] T. W. Cusick, <em>Stream Ciphers and Number Theory</em>,, Elsevier (2004) · Zbl 1069.11053
[11] P. Dembowski, Planes of order \(n\) with collineation groups of order \(n^2\),, Math. Z., 103, 239 (1968) · Zbl 0163.42402 · doi:10.1007/BF01111042
[12] C. Ding, Signal sets from functions with optimum nonlinearity,, IEEE Trans. Commun., 55, 936 (2007) · doi:10.1109/TCOMM.2007.894113
[13] The GAP Group, GAP - Groups, Algorithms and Programming,, Version 4.5.5 (2012)
[14] K. J. Horadam, <em>Hadamard Matrices and their Applications</em>,, Princeton Univ. Press (2007) · Zbl 1145.05014
[15] W. Jia, A class of binomial bent functions over the finite fields of odd characteristic,, IEEE Trans. Inf. Theory, 58, 6054 (2012) · Zbl 1364.94801 · doi:10.1109/TIT.2012.2199736
[16] D. E. Knuth, Finite semifields and projective planes,, J. Algebra, 2, 182 (1965) · Zbl 0128.25604 · doi:10.1016/0021-8693(65)90018-9
[17] G. Kyureghyan, Some theorems on planar mappings,, in Arithmetic of Finite Fields, 117 (2008) · Zbl 1180.94056 · doi:10.1007/978-3-540-69499-1_10
[18] G. Marino, On the nuclei of a finite semifield,, Theory Appl. Finite Fields. Contemp. Math., 579, 123 (2012) · Zbl 1298.12008 · doi:10.1090/conm/579/11525
[19] A. Roy, Weighted complex projective 2-designs from bases: Optimal state determination by orthogonal measurements,, J. Math. Phys., 48, 1 (2007) · Zbl 1144.81405 · doi:10.1063/1.2748617
[20] J. Wedderburn, A theorem on finite algebras,, Trans. Amer. Math. Soc., 6, 349 (1903) · JFM 36.0139.01 · doi:10.2307/1986226
[21] Y. Zhou, A new family of semifields with 2 parameters,, Adv. Math., 234, 43 (2013) · Zbl 1296.12007 · doi:10.1016/j.aim.2012.10.014
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.