THTor Helleseth
Tor Helleseth
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Tor Helleseth has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Chunlei Li
Department of Informatics, University of Bergen, Bergen, Norway
14 shared publications - Lilya Budaghyan
University of Bergen, Bergen, Norway
9 shared publications - Claude Carlet
University of Paris 8 Saint-Denis France
7 shared publications - Minjia Shi
Key Laboratory of Intelligent Computing Signal Processing, Ministry of Education, School of Mathematical Sciences, Anhui University, Hefei, China
5 shared publications - Yongbo Xia
School of Mathematics and Statistics, and also with the Hubei Key Laboratory of Intelligent Wireless Communications, South-Central Minzu University, Wuhan, China
5 shared publications - Alexander Kholosha
University of Bergen
4 shared publications
Latest Publications
- 18 October 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 329-346
Odd-periodic low/zero ambiguity zone: Theoretical Bounds and Optimal Constructions
- 18 October 2025
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (2) , 329-346
Odd-periodic low/zero ambiguity zone: Theoretical Bounds and Optimal Constructions
- 2 October 2025
- Published by Springer Nature in Journal of Cryptology
- Vol. 38 (4) , 1-34
New Characterizations of Dillon-like Hyperbent Functions via Dickson Polynomials
- 2 October 2025
- Published by Springer Nature in Journal of Cryptology
- Vol. 38 (4) , 1-34
New Characterizations of Dillon-like Hyperbent Functions via Dickson Polynomials
- Open Access
Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by $f(x)=\Tr_{4k}\big(a_1 x^{2(3^k+1)}+a_2 x^{(3^k+1)^2}\big)$, where $a_1$ is a nonsquare in $\F_{3^{4k}}$ and $a_2$ is defined explicitly by $a_1$. Particular subclasses of the binomial bent functions we found can be represented by exceptional polynomials over $\fthreek$. Bent trinomials are mappings $\F_{3^{2k}}\mapsto\fthree$ given by $f(x)=\Tr_n\big(a_1 x^{2\cdot3^k+4} + a_2 x^{3^k+5} + a_3 x^2\big)$ with coefficients explicitly defined by the parity of $k$. The proof is based on a new criterion that allows checking bentness by analyzing first- and second-order derivatives of $f$ in the direction of a chosen $n/2$-dimensional subspace.Open AccessTernary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by $f(x)=\Tr_{4k}\big(a_1 x^{2(3^k+1)}+a_2 x^{(3^k+1)^2}\big)$, where $a_1$ is a nonsquare in $\F_{3^{4k}}$ and $a_2$ is defined explicitly by $a_1$. Particular subclasses of the binomial bent functions we found can be represented by exceptional polynomials over $\fthreek$. Bent trinomials are mappings $\F_{3^{2k}}\mapsto\fthree$ given by $f(x)=\Tr_n\big(a_1 x^{2\cdot3^k+4} + a_2 x^{3^k+5} + a_3 x^2\big)$ with coefficients explicitly defined by the parity of $k$. The proof is based on a new criterion that allows checking bentness by analyzing first- and second-order derivatives of $f$ in the direction of a chosen $n/2$-dimensional subspace. - 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (2) , 628-646
The differential spectrum of a power permutation
Let $ n $ be a positive integer, $ p $ an odd prime, $ d = \frac{p^n+1}{4} $ if $ p^n \equiv3 (\bmod 8) $ and $ d = \frac{p^n+1}{4}+\frac{p^n-1}{2} $ if $ p^n \equiv7 (\bmod 8) $. It was shown that the differential uniformity of the power permutation $ x^d $ over $ \mathbb{F}_{p^n} $ is no more than $ 4 $. In this paper, we further investigate the differential properties of this power permutation. By studying the differential equation of $ x^d $ and certain equation system over $ \mathbb{F}_{p^n} $, we completely determined the differential spectrum of this power permutation.- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 19 (2) , 628-646
The differential spectrum of a power permutation
Let $ n $ be a positive integer, $ p $ an odd prime, $ d = \frac{p^n+1}{4} $ if $ p^n \equiv3 (\bmod 8) $ and $ d = \frac{p^n+1}{4}+\frac{p^n-1}{2} $ if $ p^n \equiv7 (\bmod 8) $. It was shown that the differential uniformity of the power permutation $ x^d $ over $ \mathbb{F}_{p^n} $ is no more than $ 4 $. In this paper, we further investigate the differential properties of this power permutation. By studying the differential equation of $ x^d $ and certain equation system over $ \mathbb{F}_{p^n} $, we completely determined the differential spectrum of this power permutation.- 12 December 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (1) , 27-44
A direct method for calculating the differential spectrum of an APN power mapping
- 12 December 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (1) , 27-44
A direct method for calculating the differential spectrum of an APN power mapping
- Open Access
- 27 November 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (6) , 1183-1185
Editorial: Special issue on Boolean functions and their applications 2023
- 27 November 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (6) , 1183-1185
Open AccessEditorial: Special issue on Boolean functions and their applications 2023
- Open Access
Determining the covering radius of all generalized Zetterberg codes in odd characteristic
For an integer $s\ge 1$, let $\mathcal{C}_s(q_0)$ be the generalized Zetterberg code of length $q_0^s+1$ over the finite field $\F_{q_0}$ of odd characteristic. Recently, Shi, Helleseth, and Özbudak (IEEE Trans. Inf. Theory 69(11): 7025-7048, 2023) determined the covering radius of $\mathcal{C}_s(q_0)$ for $q_0^s \not \equiv 7 \pmod{8}$, and left the remaining case as an open problem. In this paper, we develop a general technique involving arithmetic of finite fields and algebraic curves over finite fields to determine the covering radius of all generalized Zetterberg codes for $q_0^s \equiv 7 \pmod{8}$, which therefore solves this open problem. We also introduce the concept of twisted half generalized Zetterberg codes of length $\frac{q_0^s+1}{2}$, and show the same results hold for them. As a result, we obtain some quasi-perfect codes.Open AccessDetermining the covering radius of all generalized Zetterberg codes in odd characteristic
For an integer $s\ge 1$, let $\mathcal{C}_s(q_0)$ be the generalized Zetterberg code of length $q_0^s+1$ over the finite field $\F_{q_0}$ of odd characteristic. Recently, Shi, Helleseth, and Özbudak (IEEE Trans. Inf. Theory 69(11): 7025-7048, 2023) determined the covering radius of $\mathcal{C}_s(q_0)$ for $q_0^s \not \equiv 7 \pmod{8}$, and left the remaining case as an open problem. In this paper, we develop a general technique involving arithmetic of finite fields and algebraic curves over finite fields to determine the covering radius of all generalized Zetterberg codes for $q_0^s \equiv 7 \pmod{8}$, which therefore solves this open problem. We also introduce the concept of twisted half generalized Zetterberg codes of length $\frac{q_0^s+1}{2}$, and show the same results hold for them. As a result, we obtain some quasi-perfect codes. - 10 November 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1549-1573
Further investigation on differential properties of the generalized Ness–Helleseth function
- 10 November 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1549-1573
Further investigation on differential properties of the generalized Ness–Helleseth function
- Open Access
Further Investigation on Differential Properties of the Generalized Ness-Helleseth Function
Let $n$ be an odd positive integer, $p$ be a prime with $p\equiv3\pmod4$, $d_{1} = {{p^{n}-1}\over {2}} -1 $ and $d_{2} =p^{n}-2$. The function defined by $f_u(x)=ux^{d_{1}}+x^{d_{2}}$ is called the generalized Ness-Helleseth function over $\mathbb{F}_{p^n}$, where $u\in\mathbb{F}_{p^n}$. It was initially studied by Ness and Helleseth in the ternary case. In this paper, for $p^n \equiv 3 \pmod 4$ and $p^n \ge7$, we provide the necessary and sufficient condition for $f_u(x)$ to be an APN function. In addition, for each $u$ satisfying $χ(u+1) = χ(u-1)$, the differential spectrum of $f_u(x)$ is investigated, and it is expressed in terms of some quadratic character sums of cubic polynomials, where $χ(\cdot)$ denotes the quadratic character of $\mathbb{F}_{p^n}$.Open AccessFurther Investigation on Differential Properties of the Generalized Ness-Helleseth Function
Let $n$ be an odd positive integer, $p$ be a prime with $p\equiv3\pmod4$, $d_{1} = {{p^{n}-1}\over {2}} -1 $ and $d_{2} =p^{n}-2$. The function defined by $f_u(x)=ux^{d_{1}}+x^{d_{2}}$ is called the generalized Ness-Helleseth function over $\mathbb{F}_{p^n}$, where $u\in\mathbb{F}_{p^n}$. It was initially studied by Ness and Helleseth in the ternary case. In this paper, for $p^n \equiv 3 \pmod 4$ and $p^n \ge7$, we provide the necessary and sufficient condition for $f_u(x)$ to be an APN function. In addition, for each $u$ satisfying $χ(u+1) = χ(u-1)$, the differential spectrum of $f_u(x)$ is investigated, and it is expressed in terms of some quadratic character sums of cubic polynomials, where $χ(\cdot)$ denotes the quadratic character of $\mathbb{F}_{p^n}$. - 27 July 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (4) , 937-959
Investigation of the permutation and linear codes from the Welch APN function
- 27 July 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (4) , 937-959
Investigation of the permutation and linear codes from the Welch APN function