- Research Article
- 10.1007/s10623-025-01734-5
- Oct 4, 2025
- Designs, Codes and Cryptography
- Gustavo T Bastos + 3 more
- Research Article
- 10.1007/s10623-025-01728-3
- Oct 2, 2025
- Designs, Codes and Cryptography
- Amin Bahmanian
- Research Article
- 10.1007/s10623-025-01730-9
- Sep 28, 2025
- Designs, Codes and Cryptography
- Seyed Hassan Alavi
- Research Article
- 10.1007/s10623-025-01668-y
- Sep 19, 2025
- Designs, Codes and Cryptography
- Gang Wang + 2 more
- Research Article
- 10.1007/s10623-025-01713-w
- Aug 31, 2025
- Designs, Codes and Cryptography
- Gustavo T Bastos + 3 more
- Research Article
- 10.1007/s10623-025-01712-x
- Aug 14, 2025
- Designs, Codes and Cryptography
- Claude Carlet + 1 more
Abstract In two papers entitled “Two generalizations of almost perfect nonlinearity” and “On the vector subspaces of $$\mathbb F_{2^n}$$ F 2 n over which the multiplicative inverse function sums to zero”, the first author has introduced and studied the notion of sum-freedom of vectorial functions, which expresses that a function sums to nonzero values over all affine subspaces of $$\mathbb {F}_{2^n}$$ F 2 n of a given dimension $$k\ge 2$$ k ≥ 2 , and he then focused on the kth order sum-freedom of the multiplicative inverse function $$x\in \mathbb {F}_{2^n}\mapsto x^{2^n-2}$$ x ∈ F 2 n ↦ x 2 n - 2 . Some general results were given for this function (in particular, the case of affine spaces that do not contain 0 was solved positively), and the cases of $$k\in \{3,4,n-4,n-3\}$$ k ∈ { 3 , 4 , n - 4 , n - 3 } and of k not co-prime with n were solved as well (negatively); but the cases of those linear subspaces of dimension $$k\in \llbracket 5;n-5\rrbracket $$ k ∈ 〚 5 ; n - 5 〛 , co-prime with n, were left open. The present paper is a continuation of the previous work. After studying, from two different angles, the particular case of those linear subspaces that are stable under the Frobenius automorphism, we deduce from the second approach that, for k small enough (approximately, $$3\le k\le n/10$$ 3 ≤ k ≤ n / 10 ), the multiplicative inverse function is not kth order sum-free. Finally, we deduce from results previously obtained in the second paper mentioned above, that for any even n and every $$2\le k\le n-2$$ 2 ≤ k ≤ n - 2 , the multiplicative inverse function is not kth order sum-free.
- Research Article
- 10.1007/s10623-025-01711-y
- Aug 13, 2025
- Designs, Codes and Cryptography
- Denis S Krotov + 2 more
- Research Article
- 10.1007/s10623-025-01708-7
- Aug 8, 2025
- Designs, Codes and Cryptography
- Yueying Lou + 1 more
- Research Article
- 10.1007/s10623-025-01703-y
- Aug 7, 2025
- Designs, Codes and Cryptography
- Tianling Weng + 5 more
- Research Article
- 10.1007/s10623-025-01707-8
- Aug 7, 2025
- Designs, Codes and Cryptography
- Jie Liu + 2 more