On a classification of planar functions in characteristic three

Abstract Planar functions are functions over a finite field that have optimal combinatorial properties and they have applications in several branches of mathematics, including algebra, projective geometry and cryptography. There are two relevant equivalence relations for planar functions, that are isotopic equivalence and CCZ-equivalence. Classification of planar functions is performed via CCZ-equivalence which arises from cryptographic applications. In the case of quadratic planar functions, isotopic equivalence, coming from connections to commutative semifields, is more general than CCZ-equivalence and isotopic transformations can be considered as a construction method providing up to two CCZ-inequivalent mappings. In this paper, we first survey known infinite classes and sporadic cases of planar functions up to CCZ-equivalence, aiming to exclude equivalent cases and to identify those with the potential to provide additional functions via isotopic equivalence. In particular, for fields of order $$\varvec{3^n}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mn>3</mml:mn> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:math> with $$\varvec{n\le 11}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>11</mml:mn> </mml:mrow> </mml:math> , we completely resolve if and when isotopic equivalence provides different CCZ-classes for all currently known planar functions. Further, we perform an extensive computational investigation on some of these fields and find seven new sporadic planar functions over $$\varvec{\mathbb {F}_{3^6}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:msup> <mml:mn>3</mml:mn> <mml:mn>6</mml:mn> </mml:msup> </mml:msub> </mml:mrow> </mml:math> and two over $$\varvec{\mathbb {F}_{3^9}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:msup> <mml:mn>3</mml:mn> <mml:mn>9</mml:mn> </mml:msup> </mml:msub> </mml:mrow> </mml:math> . Finally, we give new simple quadrinomial representatives for the Dickson family of planar functions.

Authors

Institutions

Publication Details

Journal
Cryptography and Communications
Published
2025-02-18
DOI
https://doi.org/10.1007/s12095-025-00781-y
Citations
1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On a classification of planar functions in characteristic three

Nikolay Kaleyski, Lilya Budaghyan, Enrico Piccione, Robert S. Coulter et al.
1 citations
Cryptography and Communications
Coding theory and cryptography
2.48
article

On a classification of planar functions in characteristic three

Nikolay Kaleyski, Lilya Budaghyan, Enrico Piccione, Robert S. Coulter, Samuele Andreoli, Alise Haukenes
article en
1 citations

Abstract

Abstract Planar functions are functions over a finite field that have optimal combinatorial properties and they have applications in several branches of mathematics, including algebra, projective geometry and cryptography. There are two relevant equivalence relations for planar functions, that are isotopic equivalence and CCZ-equivalence. Classification of planar functions is performed via CCZ-equivalence which arises from cryptographic applications. In the case of quadratic planar functions, isotopic equivalence, coming from connections to commutative semifields, is more general than CCZ-equivalence and isotopic transformations can be considered as a construction method providing up to two CCZ-inequivalent mappings. In this paper, we first survey known infinite classes and sporadic cases of planar functions up to CCZ-equivalence, aiming to exclude equivalent cases and to identify those with the potential to provide additional functions via isotopic equivalence. In particular, for fields of order $$\varvec{3^n}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mn>3</mml:mn> <mml:mi>n</mml:mi> </mml:msup> </mml:mrow> </mml:math> with $$\varvec{n\le 11}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>11</mml:mn> </mml:mrow> </mml:math> , we completely resolve if and when isotopic equivalence provides different CCZ-classes for all currently known planar functions. Further, we perform an extensive computational investigation on some of these fields and find seven new sporadic planar functions over $$\varvec{\mathbb {F}_{3^6}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:msup> <mml:mn>3</mml:mn> <mml:mn>6</mml:mn> </mml:msup> </mml:msub> </mml:mrow> </mml:math> and two over $$\varvec{\mathbb {F}_{3^9}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>F</mml:mi> <mml:msup> <mml:mn>3</mml:mn> <mml:mn>9</mml:mn> </mml:msup> </mml:msub> </mml:mrow> </mml:math> . Finally, we give new simple quadrinomial representatives for the Dickson family of planar functions.

Cryptography and CommunicationsVol. 17(4)
University of Bergen (NO), University of Delaware (US)
Norges Forskningsråd
Openalex Percentile: Top 12%
Coding theory and cryptography
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.