nach oben

Cryptography and Communications

Erschienen in:

17.05.2019

Several new classes of self-dual bent functions derived from involutions

verfasst von: Gaojun Luo, Xiwang Cao, Sihem Mesnager

Erschienen in: Cryptography and Communications | Ausgabe 6/2019

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Bent functions are a kind of Boolean functions which have the maximum Hamming distance to linear and affine functions, they have some interesting applications in combinatorics, coding theory, cryptography and sequences. However, generally speaking, how to find new bent functions is a hard work and is a hot research project during the past decades. A subclass of bent functions that has received attention since Dillon’s seminal thesis (1974) is the subclass of those Boolean functions that are equal to their dual (or Fourier transform in Dillon’s terminology): the so-called self dual bent functions. In this paper, we propose a construction of involutions from linear translators, and provide two methods for constructing new involutions by utilizing some given involutions. With the involutions presented in this paper, several new classes of self-dual bent functions are produced.

Vorheriger Artikel Multiple characters transforms and generalized Boolean functions

Nächster Artikel Frobenius linear translators giving rise to new infinite classes of permutations and bent functions

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Carlet, C.: On bent and highly nonlinear balanced/resilient functions and their algebraic immunities, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp 1–28. Springer, Berlin (2006)MATH

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, pp 257–397. Cambridge Univ. Press, Cambridge (2010)

Carlet, C.: Two New Classes of Bent Functions. Advances in Cryptology EUROCRYPT, 93, 77–101, Lecture Notes in Comput Sci., vol. 765. Springer, Berlin (1994)

Carlet, C., Mesnager, S.: Four Decades of Research on Bent Functions. Journal Designs, Codes and Cryptography (2016)

Çesmelioğlu, A., Meidl, W., Pott, A.: Vectorial bent functions and their duals. Linear Algebra Appl. 548, 305–320 (2018)MathSciNetCrossRef

Charpin, P., Mesnager, S., Sarkar, S.: Involutions over the Galois field \({F}_{2^{n}}\). IEEE Trans. Inf. Theory 62(4), 2266–2276 (2016)CrossRef

Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. Amsterdam, The Netherlands (1997)MATH

Coulter, R., Mesnager, S.: Bent Functions From Involutions Over \({F}_{2^{n}}\). IEEE Trans. Inf. Theory 64(4), 2979–2986 (2018)CrossRef

Dillon, J.: Elementary Hadamard Difference Sets, Ph.D. Dissertation, Netw. Commun. Lab., Univ., Maryland (1974)

10.

Ding, C.: A construction of binary linear codes from Boolean functions. Discret. Math. 339, 2288–2303 (2016)MathSciNetCrossRef

11.

Kolomeec, N.: The graph of minimal distances of bent functions and its properties. Des. Codes Cryptogr. 85, 395–410 (2017)MathSciNetCrossRef

12.

Kolomeec, N.: Enumeration of the bent functions of least deviation from a quadratic bent function. J. Appl. Ind. Math. 6(3), 306–317 (2012)MathSciNetCrossRef

13.

Kyureghyan, G.: Constructing permutations of finite fields via linear translators. J. Comb. Theory, Ser. A 118, 1052–1061 (2011)MathSciNetCrossRef

14.

Lidl, R., Niederreiter, H.: Finite fields. University Press, Cambridge (1997)MATH

15.

Mesnager, S.: Several new infinite families of bent functions and their duals. IEEE Trans. Inf. Theory 60(7), 4397–4407 (2014)MathSciNetCrossRef

16.

Mesnager, S.: Further constructions of infinite families of bent functions from new permutations and their duals. Crypt. Commun. 8(2), 229–246 (2016)MathSciNetCrossRef

17.

Mesnager, S., Cohen, G., Madore, D.: On existence (based on an arithmetical problem) and constructions of bent functions. In: Proceedings of 15th International Conference on Cryptograph. Coding, pp. 3–19 (2015)

18.

Mesnager, S.: On constructions of bent functions from involutions. In: Proceedings of ISIT, pp. 110–114 (2016)

19.

Mesnager, S.: Bent Functions: Fundamentals and Results. Springer, Switzerland (2016)CrossRef

20.

Mesnager, S., Ongan, P., Ozbudak, F.: New bent functions from permutations and linear translators, c2SI 2017: Codes, Cryptology and Information Security, pp. 282–297 (2017)CrossRef

21.

Rothaus, O.: On ‘bent’ functions. J. Combinat. Theory, Ser. A 20(3), 300–305 (1976)CrossRef

22.

Olsen, J., Scholtz, R., Welch, L.: Bent-function sequences. IEEE Trans. Inf. Theory 28(6), 858–864 (1982)MathSciNetCrossRef

23.

Pott, A., Tan, Y., Feng, T.: Strongly regular graphs associated with ternary bent functions. J. Combinat. Theory, Ser. A 117(6), 668–682 (2010)MathSciNetCrossRef

24.

Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codes meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61(12), 6526–6535 (2015)MathSciNetCrossRef

25.

Zhou, Z., Ding, C., Li, N.: New families of codebooks achieving the Levenshtein bound. IEEE Trans. Inf. Theory 60(11), 7382–7387 (2014)CrossRef

Titel: Several new classes of self-dual bent functions derived from involutions
verfasst von: Gaojun Luo
Xiwang Cao
Sihem Mesnager
Publikationsdatum: 17.05.2019
Verlag: Springer US
Erschienen in: Cryptography and Communications / Ausgabe 6/2019
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI: https://doi.org/10.1007/s12095-019-00371-9

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 6/2019

Multiple characters transforms and generalized Boolean functions

Strongly regular graphs arising from non-weakly regular bent functions

Changing APN functions at two points

Upper bounds on the multiplicative complexity of symmetric Boolean functions

Image sets with regularity of differences

Editorial: Special issue on Boolean functions and their applications 2018