Open Access

Patrick Felke

• Let f (x) = x d be a power mapping over Fn and Ud the maximum number of solutions x ∈ Fn of � f,c (x) := f (x + c) − f (x) = a, where c, a ∈ Fn and c � = 0. f is said to be differentially k-uniform if Ud = k. The investigation of power functions with low dif- ferential uniformity over finite fields Fn of odd characteristic has attracted a lot of research interest since Helleseth, Rong and Sandberg started to conduct extensive computer search to identify such functions. These numerical results are well-known as the Helleseth-Rong- Sandberg tables and are the basis of many infinite families of power mappings x dn , n ∈ N, of low uniformity (see e.g. Dobbertin et al. Discret. Math. 267, 95–112 2003; Helleseth et al. IEEE Trans. Inform Theory, 45, 475–485 1999; Helleseth and Sandberg AAECC, 8, 363–370 1997; Leducq Amer. J. Math. 1(3) 115–123 1878; Zha and Wang Sci. China Math. 53(8) 1931–1940 2010). Recently the crypto currency IOTA and Cybercrypt started to build computer chips around base-3 logic to employ their new ternary hash function Troika, which currently increases the cryptogrpahic interest in such families. Especially bijective power mappings are of interest, as they can also be employed in block- and stream ciphers. In this paper we contribute to this development and give a family of power mappings x dn with low uniformity over Fn, which is bijective for p ≡ 3 mod 4. For p = 3 this yields a family x dn with 3 ≤ Udn ≤ 4, where the family of inverses has a very simple description. These results explain “open entries” in the Helleseth-Rong-Sandberg tables. We apply the multi- variate method to compute the uniformity and thereby give a self-contained introduction to this method. Moreover we will prove for a related family of low uniformity introduced in Helleseth and Sandberg (AAECC, 8 363–370 1997) that it yields permutations.