Browsing Faculty of Mathematics and Natural Sciences by Journals "Designs, Codes and Cryptography"

Now showing items 1-10 of 10

    • CCZ-equivalence of bent vectorial functions and related constructions 

      Budaghyan, Lilya; Carlet, Claude (Peer reviewed; Journal article, 2011-01-06)
      We observe that the CCZ-equivalence of bent vectorial functions over F2nFn2 (n even) reduces to their EA-equivalence. Then we show that in spite of this fact, CCZ-equivalence can be used for constructing bent functions ...

    • Cryptographically strong permutations from the butterfly structure 

      Li, Kangquan; Li, Chunlei; Helleseth, Tor; Qu, Longjiang (Journal article; Peer reviewed, 2021)
      Boomerang connectivity table is a new tool to characterize the vulnerability of cryptographic functions against boomerang attacks. Consequently, a cryptographic function is desired to have boomerang uniformity as low as ...

    • Differentially low uniform permutations from known 4-uniform functions 

      Calderini, Marco (Journal article; Peer reviewed, 2021)
      Functions with low differential uniformity can be used in a block cipher as S-boxes since they have good resistance to differential attacks. In this paper we consider piecewise constructions for permutations with low ...

    • Generalized isotopic shift construction for APN functions 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude Michael; Coulter, Robert; Villa, Irene (Journal article; Peer reviewed, 2021)
      In this work we give several generalizations of the isotopic shift construction, introduced recently by Budaghyan et al. (IEEE Trans Inform Theory 66:5299–5309, 2020), when the initial function is a Gold function. In ...

    • Gold functions and switched cube functions are not 0-extendable in dimension n > 5 

      Beierle, Christof; Carlet, Claude Michael (Journal article; Peer reviewed, 2023)
      In the independent works by Kalgin and Idrisova and by Beierle, Leander and Perrin, it was observed that the Gold APN functions over \(\mathbb {F}_{2^5}\) give rise to a quadratic APN function in dimension 6 having maximum ...

    • Lower bounds on the size of spheres of permutations under the Chebychev distance 

      Kløve, Torleiv (Peer reviewed; Journal article, 2011)
      Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given

    • Partially APN functions with APN-like polynomial representations 

      Budaghyan, Lilya; Kaleyski, Nikolay Stoyanov; Riera, Constanza Susana; Stănică, Pantelimon (Journal article; Peer reviewed, 2020)
      In this paper we investigate several families of monomial functions with APN-like exponents that are not APN, but are partially 0-APN for infinitely many extensions of the binary field F2. We also investigate the differential ...

    • Proposing an MILP-based method for the experimental verification of difference-based trails: application to SPECK, SIMECK 

      Sadeghi, Sadegh; Rijmen, Vincent Stefaan; Bagheri, Nasour (Journal article; Peer reviewed, 2021)
      Searching for the right pairs of inputs in difference-based distinguishers is an important task for the experimental verification of the distinguishers in symmetric-key ciphers. In this paper, we develop an MILP-based ...

    • Simplicity conditions for binary orthogonal arrays 

      Carlet, Claude Michael; Kiss, Rebeka; Nagy, Gábor P. (Journal article; Peer reviewed, 2023)
      It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. The supports of CI functions are (equivalently) simple orthogonal arrays, when their ...

    • Sparse Boolean equations and circuit lattices 

      Semaev, Igor (Peer reviewed; Journal article, 2011)
      A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In ...