Advertisement

Unicyclic strong permutations

  • Claude Gravel
  • Daniel Panario
  • David Thomson
Article
Part of the following topical collections:
  1. Special Issue on Boolean Functions and Their Applications

Abstract

In this paper, we study some properties of a certain kind of permutation σ over \(\mathbb {F}_{2}^{n}\), where n is a positive integer. The desired properties for σ are: (1) the algebraic degree of each component function is n − 1; (2) the permutation is unicyclic; (3) the number of terms of the algebraic normal form of each component is at least 2n− 1. We call permutations that satisfy these three properties simultaneously unicyclic strong permutations. We prove that our permutations σ always have high algebraic degree and that the average number of terms of each component function tends to 2n− 1. We also give a condition on the cycle structure of σ. We observe empirically that for n even, our construction does not provide unicylic permutations. For n odd, n ≤ 11, we conduct an exhaustive search of all σ given our construction for specific examples of unicylic strong permutations. We also present some empirical results on the difference tables and linear approximation tables of σ.

Keywords

Boolean functions Finite fields Permutations Algebraic degree Differential uniformity Walsh spectra 

Mathematics Subject Classification (2010)

11T06 11T71 

Notes

Acknowledgments

The authors are grateful for the very careful reviews and the constructive suggestions received from the referees.

References

  1. 1.
    Bacher, A., Bodini, O., Hwang, H.-K., Tsai, T.-H.: Generating random permutations by coin tossing: Classical algorithms, new analysis, and modern implementation. ACM Trans. Algor. 13(2), 1–43 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4(1), 3–72 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Brassard, G., Kannan, S.: The generation of random permutations on the fly. Inf. Process. Lett., 28(4) (1988)Google Scholar
  4. 4.
    Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. monography’s chapter, pp 257–397. Cambridge University Press (2010)Google Scholar
  5. 5.
    Carlet, C.: Vectorial boolean functions for cryptography. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. monography’s chapter, pp 398–469. Cambridge University Press (2010)Google Scholar
  6. 6.
    Daemen, J., Vincent, R.: The Design of Rijndael: AES-the Advanced Encryption Standard. Springer Science & Business Media (2013)Google Scholar
  7. 7.
    Flajolet, P., Odlyzko, A.M.: Random mapping statistics. In: Quisquater, J.-J., Vandewalle, J. (eds.) Advances in Cryptology — EUROCRYPT ’89, vol. 434, pp 329–354. LNCS (1990)Google Scholar
  8. 8.
    Flajolet, P., Sedgewick, R.: Analytic Combinatorics, 1st edn. Cambridge University Press (2009)Google Scholar
  9. 9.
    Hansen, T., Mullen, G.L.: Primitive polynomials over finite fields. Math. Comput. 59(200), 639–643 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Xiao, G.-Z., Massey, L., James: A spectral characterization of correlation-immune combining functions. IEEE Trans. Inf. Theory 34(3), 569–571 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Matsui, M.: Linear cryptanalysis method for DES cipher. In: Workshop on the Theory and Application of of Cryptographic Techniques, pp 386–397. Springer (1993)Google Scholar
  12. 12.
    Mullen, G.L., Panario, D: Handbook of Finite Fields. Chapman & Hall/CRC (2013)Google Scholar
  13. 13.
    Nyberg, K.: Statistical and linear independence of binary random variables. Cryptology ePrint Archive Report 2017/432 (2017)Google Scholar
  14. 14.
    Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. Info. Th. 30, 776–780 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. Wiley (2001)Google Scholar
  16. 16.
    Wan, D.: Generators and irreducible polynomials over finite fields. Math. Comput. 66(219), 1195–1212 (1997)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.MontrealCanada
  2. 2.School of Mathematics and StatisticsCarleton UniversityOttawaCanada

Personalised recommendations