Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Cryptography and Communications
Published in: Cryptography and Communications 5/2020

07-05-2020 | SI: Boolean Functions and Their Applications 2019

Recent results and problems on constructions of linear codes from cryptographic functions

Authors: Nian Li, Sihem Mesnager

Published in: Cryptography and Communications | Issue 5/2020

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Linear codes have a wide range of applications in the data storage systems, communication systems, consumer electronics products since their algebraic structure can be analyzed and they are easy to implement in hardware. How to construct linear codes with excellent properties to meet the demands of practical systems becomes a research topic, and it is an efficient way to construct linear codes from cryptographic functions. In this paper, we will introduce some methods to construct linear codes by using cryptographic functions over finite fields and present some recent results and problems in this area.
previous article Cryptographic properties of small bijective S-boxes with respect to modular addition
next article On decoding additive generalized twisted Gabidulin codes

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

inform now

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!

inform now

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!

inform now
Literature
1.
Beth, T., Ding, C.: On almost perfect nonlinear permutation, EUROCRYPT’93, Springer-Verlag. LNCS 765, 65–76 (1994)
2.
Budaghyan, L.: Construction and analysis of cryptographic functions, Springer Verlag (2015)
3.
Budaghyan, L., Helleseth, T.: New perfect nonlinear multinomials over \(\mathbb {F}_{p^{2k}}\) for any odd prime p, Springer-Verlag. LNCS 5203, 403–414 (2008)MATH
4.
Calderbank, AR, Goethals, J.M.: Three-weight codes and association schemes. Philips J. Res. 39(4-5), 143–152 (1984)MathSciNetMATH
5.
Calderbank, A.R., Kantor, W.M.: The geometry of two-weight codes. Bull. London Math. Soc. 18, 97–122 (1986)MathSciNetMATH
6.
Canteaut, A., Charpin, P., Dobbertin, H.: Weight divisibility of cyclic codes, highly nonlinear functions on \(\mathbb {F}_{2^{m}}\), and crosscorrelation of maximum-length sequences, SIAM. J. Discrete Math. 13(1), 105–138 (2000)MathSciNetMATH
7.
Canteaut, A., Charpin, P., Dobbertin, H.: Binary m-squences with three-valued crosscorrelation: a proof of Welch’s conjecture. IEEE Trans. Inf. Theory 46(1), 4–8 (2000)MATH
8.
Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15, 125–156 (1998)MathSciNetMATH
9.
Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes, Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering. In: Crama, Y, Hammer, P (eds.) , pp 257–397. Cambridge University Press (2010)
10.
Carlet, C.: Vectorial Boolean Functions for Cryptography, Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Crama, Y., Hammer, P., (eds) pp. 398–469. Cambridge: University Press (2010)
11.
Carlet, C.: Boolean and vectorial plateaued functions, and APN functions. IEEE Trans. Inf. Theory 61(11), 6272–6289 (2015)MathSciNetMATH
12.
Carlet, C.: Boolean Functions for Cryptography and Coding Theory. To appear in Cambridge University Press
13.
Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089–2102 (2005)MathSciNetMATH
14.
Çeşmelioǧlu, A., McGuire, G., Meidl, W.: A construction of weakly and non-weakly regular bent functions. J. Combin. Theory Ser. A 119(2), 420–429 (2012)MathSciNetMATH
15.
Chen, Y., Li, N., Zeng, X.: A class of binary cyclic codes with generalized Niho exponents. Finite Fields Appl. 43, 123–140 (2017)MathSciNetMATH
16.
17.
Coulter, R., Matthews, R.W.: Planar and planes of Lenz-Barlotti class II. Des. Codes Cryptogr. 10(2), 167–184 (1997)MathSciNetMATH
18.
Dembowski, P., Ostrom, T.G.: Planes of order n with collineation groups of order n2. Math. Z. 103(3), 239–258 (1968)MathSciNetMATH
19.
Ding, C.: Cyclic codes from the two-Prime sequences. IEEE Trans. Inf. Theory 58(6), 3881–3891 (2012)MathSciNetMATH
20.
21.
Ding, C.: Cyclic codes from cyclotomic sequences of order four. Finite Fields Appl. 23, 8–34 (2013)MathSciNetMATH
22.
Ding, C.: Cyclic codes from some monomials and trinomials. SIAM J. Discret. Math. 27(4), 1977–1994 (2013)MathSciNetMATH
23.
24.
Ding, C.: A construction of binary linear codes from Boolean functions. Discrete Math. 339(9), 2288–2323 (2016)MathSciNetMATH
25.
Ding, C.: A sequence construction of cyclic codes over finite fields. Cryptogr, Commun. 10(2), 319–341 (2018)MathSciNetMATH
26.
Ding, C., Helleseth, T.: Optimal ternary cyclic codes from monomials. IEEE Trans. Inf. Theory 59(9), 5898–5904 (2013)MathSciNetMATH
27.
Ding, C., Li, C., Li, N., Zhou, Z.: Three-weight cyclic codes and their weight distributions. Discrete Math. 339(2), 415–427 (2016)MathSciNetMATH
28.
Ding, C., Niederreiter, H.: Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 53(6), 2274–2277 (2007)MathSciNetMATH
29.
Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81–99 (2005)MathSciNetMATH
30.
Ding, C., Yang, Y., Tang, X.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inf. Theory 56(7), 3605–3612 (2010)MathSciNetMATH
31.
Ding, C., Yuan, J.: A family of skew Hadamard difference sets. J. Comb. Theory, Ser. A 113(7), 1526–1535 (2006)MathSciNetMATH
32.
Ding, C., Zhou, Z.: Binary cyclic codes from explicit polynomials over GF(2m). Discrete Math. 321, 76–89 (2014)MathSciNetMATH
33.
Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61(11), 5835–5842 (2015)MathSciNetMATH
34.
Dobbertin, H.: Almost perfect nonlinear power functions over GF(2n): a new case for n divisible by 5, Springer-Verlag, pp 113–121 (2000)
35.
Du, X., Wan, Y.: Linear codes from quadratic forms. Appl. Algebra Eng. Commun. Comput. 28(6), 535–547 (2017)MathSciNetMATH
36.
Feng, K., Luo, J.: Value distributions of exponential sums from perfect nonlinear functions and their applications. IEEE Trans. Inf. Theory 53(9), 3035–3041 (2007)MathSciNetMATH
37.
Gold, R.: Maximal recursive sequences with 3-valued recursive cross-correlation functions. IEEE Trans. Inf. Theory 14(1), 154–156 (1968)MATH
38.
Göloǧlu, F., Krasnayová, D.: Proofs of several conjectures on linear codes from Boolean functions. Discrete Math. 342(2), 572–583 (2019)MathSciNetMATH
39.
Han, D., Yan, H.: On an open problem about a class of optimal ternary cyclic codes. Finite Fields Appl. 59, 335–343 (2019)MathSciNetMATH
40.
Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 52(5), 2018–2032 (2006)MathSciNetMATH
41.
Helleseth, T., Kholosha, A.: New binomial bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory 56(9), 4646–4652 (2010)MathSciNetMATH
42.
43.
Heng, Z., Yue, Q.: A construction of q-ary linear codes with two weights. Finite Fields Appl. 48, 20–42 (2017)MathSciNetMATH
44.
Heng, Z., Yue, Q.: Evaluation of the Hamming weights of a class of linear codes based on Gauss sums, Des. Codes Cryptogr. 83(2), 307–326 (2017)MathSciNetMATH
45.
Heng, Z., Yue, Q., Li, C.: Three classes of linear codes with two or three weights. Discrete Math. 339, 2832–2847 (2016)MathSciNetMATH
46.
Hollmann, H., Xiang, Q.: A proof of the Welch and Niho conjectures on crosscorrelations of binary m-squences. Finite Fields Appl. 7(2), 253–286 (2001)MathSciNetMATH
47.
Hu, Z., Li, N., Zeng, X.: New linear codes with few weights derived from Kloosterman sums. Finite Fields Appl. 62, 101608 (2020)MathSciNetMATH
48.
Huffman, W., Pless, V.: Fundamentals of error-correcting codes Cambridge University Press (1997)
49.
Jian, G., Lin, Z., Feng, R.: Two-weight and three-weight linear codes based on Weil sums. Finite Fields Appl. 57, 92–107 (2019)MathSciNetMATH
50.
Kasami, T.: The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes. Inf. Control 18(4), 369–394 (1971)MATH
51.
Katz, D.J.: Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth. J. Comb. Theory, Ser. A 119(8), 1644–1659 (2012)MathSciNetMATH
52.
Kløve, T: Codes for Error Detection. World Scientific, Singapore (2007)MATH
53.
Kumar, P.V., Scholtz, R.A., Welch, L.R.: Generalized bent functions and their properties. J. Comb. Theory(A) 40(1), 90–107 (1985)MathSciNetMATH
54.
Li, C., Yue, Q., Fu, F.: A construction of several classes of two-weight and three-weight linear codes. Appl. Algebra Eng. Commun. Comput. 28(1), 11–30 (2017)MathSciNetMATH
55.
Li, C., Bae, S., Yang, S.: Some two-weight and three-weight linear codes. Math. of Comm. 13(1), 195–211 (2019)MathSciNetMATH
56.
Li, C., Li, N., Helleseth, T., Ding, C.: The weight distributions of several classes of cyclic codes from APN monomials. IEEE Trans. Inf. Theory 60(8), 4710–4721 (2014)MathSciNetMATH
57.
Li, F., Yan, Y., Wang, Q., Yan, T.: Several classes of binary linear codes and their weight enumerators. Appl. Algebra Eng. Commun. Comput. 30(2), 93–106 (2019)MathSciNetMATH
58.
Li, N., Li, C., Helleseth, T., Ding, C., Tang, X.: Optimal ternary cyclic codes with minimum distance four and five. Finite Fields Appl. 30, 100–120 (2014)MathSciNetMATH
59.
Li, N., Zeng, X.: A survey on the applications of Niho exponents. Cryptogr, Commun. 11(3), 509–548 (2019)MathSciNetMATH
60.
Li, N., Zhou, Z., Helleseth, T.: On a conjecture about a class of optimal ternary cyclic codes, IWSDA, pp 62–65 (2015)
61.
Li, S., Hu, S., Feng, T., Ge, G.: The weight distribution of a class of cyclic codes related to Hermitian forms graphs. IEEE Trans. Inf. Theory 59(5), 3064–3067 (2013)MathSciNetMATH
62.
Luo, G., Cao, X., Xu, S., Mi, J.: Binary linear codes with two or three weights from niho exponents. Cryptogr, Commun. 10(2), 301–318 (2018)MathSciNetMATH
63.
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, North-Holland, New York (1977)
64.
Meidl, W.: Generalized Rothaus construction and non-weakly regular bent functions. J. Combin. Theory Ser. A 141, 78–89 (2016)MathSciNetMATH
65.
Mesnager, S.: Linear codes with few weights from weakly regular bent functions based on a generic construction. Cryptogr, Commun. 9(1), 71–84 (2017)MathSciNetMATH
66.
Mesnager, S., Özbudak, F., Sinak, A.: Linear codes from weakly regular plateaued functions and their secret sharing schemes. Des. Codes Cryptogr. 87(2-3), 463–480 (2019)MathSciNetMATH
67.
Niho, Y.: Multi-valued cross-correlation functions between two maimal linear recursive sequences Doctorial Dissertation (1972)
68.
Nyberg, K.: Perfect nonlinear S-boxes, EUROCRYPT’91, Springer-Verlag. LNCS 547, 378–386 (1991)MATH
69.
Nyberg, K.: Differentially uniform mappings for cryptography, EUROCRYPT’93, Springer-Verlag. LNCS 765, 55–64 (1994)MATH
70.
71.
Rothaus, O.S.: On “bent” functions. J. Combin. Theory Ser. A 20(3), 300–305 (1976)MATH
72.
Tang, C., Li, N., Qi, Y., Zhou, Z., Helleseth, T.: Linear codes with two or three weights from weakly regualr bent functions. IEEE Trans. Inf. Theory 62(3), 1166–1176 (2016)MATH
73.
Tang, C., Qi, Y., Xu, M.: A note on cyclic codes from APN functions. Appl. Algebra Eng. Commun. Comput. 25(1-2), 21–37 (2014)MathSciNetMATH
74.
Tang, D., Carlet, C., Zhou, Z.: Binary linear codes from vectorial boolean functions and their weight distribution. Discrete Math. 340(12), 3055–3072 (2017)MathSciNetMATH
75.
Tangaraj, A., McLaughlin, S.W.: Quantum codes from cyclic codes over GF(4m). IEEE Trans. Inf. Theory 47(3), 1176–1178 (2001)
76.
Wang, Q., Li, F., Lin, D.: A class of linear codes with three weights. CoRR abs/1512.03866 (2015)
77.
Wang, X., Zheng, D., Liu, H.: Several classes of linear codes and their weight distributions. Appl. Algebra Eng. Commun. Comput. 30(1), 75–92 (2019)MathSciNetMATH
78.
Wolfmann, J.: Bent functions and coding theory. Difference Sets, Sequences and their Correlation Properties, A. Pott, P. V. Kumar, T. Helleseth and D. Jungnickel, eds.,pp. 393–417. Amsterdam: Kluwer (1999)
79.
Wu, Y., Li, N., Zeng, X.: Linear codes from perfect nonlinear functions over finite fields, under reveiw
80.
Wu, Y., Li, N., Zeng, X.: Linear codes with few weights from cyclotomic classes and weakly regular bent functions, under reveiw
81.
Xia, Y., Li, C.: Three-weight ternary linear codes from a family of power functions. Finite Fields Appl. 46, 17–37 (2017)MathSciNetMATH
82.
83.
Xiang, C., Feng, K., Tang, C.: A Construction of linear codes over \(\mathbb {F}_{2^{t}}\) from Boolean functions. IEEE Trans. Inf. Theory 63(1), 169–176 (2017)MATH
84.
Xiong, M., Li, N.: Optimal cyclic codes with generalized Niho-type zeros and the weight distribution. IEEE Trans. Inf. Theory 61(9), 4914–4922 (2015)MathSciNetMATH
85.
Xiong, M., Li, N., Zhou, Z., Ding, C.: Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes. Des Codes Cryptogr. 78(3), 713–730 (2016)MathSciNetMATH
86.
Xu, Y., Carlet, C., Mesnager, S., Wu, C.: Classification of bent monomials, constructions of bent multinomials and upper bounds on the nonlinearity of vectorial functions. IEEE Trans. Inf. Theory 64(1), 367–383 (2018)MathSciNetMATH
87.
Yang, S., Yao, Z.: Complete weight enumerators of a family of three-weight linear codes. Des Codes Cryptogr. 82(3), 663–674 (2017)MathSciNetMATH
88.
Yang, S., Yao, Z.: Complete weight enumerators of a class of linear codes. Discrete Math. 340(4), 729–739 (2017)MathSciNetMATH
89.
Yuan, J., Carlet, C., Ding, C.: The weight distributions of a class of linear codes from perfect nonlinear functions. IEEE Trans. Inf. Thoery 52(2), 712–716 (2006)MathSciNetMATH
90.
Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006)MathSciNetMATH
91.
Zha, Z., Kyureghyan, G.M., Wang, X.: Perfect nonlinear binomials and their semifields. Finite Fields Appl. 15(2), 125–133 (2009)MathSciNetMATH
92.
Zeng, X., Hu, L., Jiang, W., Yue, Q., Cao, X.: The weight distribution of a class of p-ary cyclic codes. Finite Fields Appl 16(1), 56–73 (2010)MathSciNetMATH
93.
Zeng, X., Li, N., Hu, L.: A class of nonbinary codes and sequence families, SETA, pp 81–94 (2008)
94.
Zeng, X., Liu, J., Hu, L.: Generalized Kasami sequences: the large set. IEEE Trans. Inf. Theory 53(7), 2587–2598 (2007)MathSciNetMATH
95.
Zeng, X., Shan, J., Hu, L.: A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions. Finite Fields Appl. 18(1), 70–92 (2012)MathSciNetMATH
96.
Zhou, Z., Li, N., Fan, C., Helleseth, T.: Linear codes with two or three weights from quadratic bent functions. Des Codes Cryptogr. 81(2), 283–295 (2016)MathSciNetMATH
97.
Zhou, Z., Zhang, A., Ding, C., Xiong, M.: The weight enumerator of three families of cyclic codes. IEEE Trans. Inf. Theory 59(9), 6002–6009 (2013)MathSciNetMATH
98.
Zheng, Y., Zhang, X.: Plateaued functions, Proceedings of ICICS’99. LNCS 1726, 284–300 (1999)
Metadata
Title
Recent results and problems on constructions of linear codes from cryptographic functions
Authors
Nian Li
Sihem Mesnager
Publication date
07-05-2020
Publisher
Springer US
Published in
Cryptography and Communications / Issue 5/2020
Print ISSN: 1936-2447
Electronic ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-020-00435-1

Other articles of this Issue 5/2020

Cryptography and Communications 5/2020 Go to the issue

EditorialNotes

Editorial: Special issue on Boolean functions and their applications

OriginalPaper

A note on the distinctness of some Kloosterman sums

OriginalPaper

On the EA-classes of known APN functions in small dimensions

OriginalPaper

Cryptographic properties of small bijective S-boxes with respect to modular addition

OriginalPaper

The group of automorphisms of the set of self-dual bent functions

OriginalPaper

The multivariate method strikes again: New power functions with low differential uniformity in odd characteristic

Premium Partner

    Image Credits