Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions

Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many construction methods for linear codes from functions have been proposed in the literature. In this paper, we generalize the recent construction methods given by Tang et al. in [IEEE Transactions on Information Theory, 62(3), 1166-1176, 2016] to weakly regular plateaued functions over finite fields of odd characteristic. We first construct three-weight linear codes from weakly regular plateaued functions based on the second generic construction and then determine their weight distributions. We also give a punctured version and subcode of each constructed code. We note that they may be (almost) optimal codes and can be directly employed to obtain (democratic) secret sharing schemes, which have diverse applications in the industry. We next observe that the constructed codes are minimal for almost all cases and finally describe the access structures of the secret sharing schemes based on their dual codes.

[1]  Cunsheng Ding,et al.  Secret sharing schemes from three classes of linear codes , 2006, IEEE Transactions on Information Theory.

[2]  Sihem Mesnager,et al.  Bent Functions: Fundamentals and Results , 2016 .

[3]  Tor Helleseth,et al.  Linear codes with two or three weights from quadratic Bent functions , 2015, Des. Codes Cryptogr..

[4]  John J. Cannon,et al.  The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[5]  Cunsheng Ding,et al.  How to Build Robust Shared Control Systems , 1998, Des. Codes Cryptogr..

[6]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[7]  R. J. McEliece,et al.  On sharing secrets and Reed-Solomon codes , 1981, CACM.

[8]  Alexander Barg,et al.  Minimal Vectors in Linear Codes , 1998, IEEE Trans. Inf. Theory.

[9]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[10]  JM Jeroen Doumen,et al.  Some applications of coding theory in cryptography , 2003 .

[11]  Cunsheng Ding,et al.  Minimal Linear Codes over Finite Fields , 2018, Finite Fields Their Appl..

[12]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[13]  Wilfried Meidl,et al.  A construction of weakly and non-weakly regular bent functions , 2010, J. Comb. Theory, Ser. A.

[14]  Tor Helleseth,et al.  Monomial and quadratic bent functions over the finite fields of odd characteristic , 2006, IEEE Transactions on Information Theory.

[15]  R. Calderbank,et al.  The Geometry of Two‐Weight Codes , 1986 .

[16]  Yoonjin Lee,et al.  Explicit Criteria for Construction of Plateaued Functions , 2016, IEEE Transactions on Information Theory.

[17]  Cunsheng Ding,et al.  Minimal Binary Linear Codes , 2018, IEEE Transactions on Information Theory.

[18]  Seunghwan Chang,et al.  Linear codes from simplicial complexes , 2018, Des. Codes Cryptogr..

[19]  Sihem Mesnager,et al.  A new class of three-weight linear codes from weakly regular plateaued functions , 2017, ArXiv.

[20]  Sihem Mesnager,et al.  Linear codes with few weights from weakly regular bent functions based on a generic construction , 2016, Cryptography and Communications.

[21]  Timo Neumann,et al.  BENT FUNCTIONS , 2006 .

[22]  Cunsheng Ding,et al.  A construction of binary linear codes from Boolean functions , 2015, Discret. Math..

[23]  Cunsheng Ding,et al.  Linear Codes From Some 2-Designs , 2015, IEEE Transactions on Information Theory.

[24]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[25]  Yuliang Zheng,et al.  On plateaued functions , 1999, IEEE Trans. Inf. Theory.

[26]  Sihem Mesnager,et al.  Linear codes from weakly regular plateaued functions and their secret sharing schemes , 2018, Des. Codes Cryptogr..

[27]  Cunsheng Ding,et al.  Covering and Secret Sharing with Linear Codes , 2003, DMTCS.

[28]  Tor Helleseth,et al.  Linear Codes With Two or Three Weights From Weakly Regular Bent Functions , 2015, IEEE Transactions on Information Theory.

[29]  Sihem Mesnager,et al.  Results on Characterizations of Plateaued Functions in Arbitrary Characteristic , 2015, BalkanCryptSec.

[30]  A. Calderbank,et al.  THREE-WEIGHT CODES AND ASSOCIATION SCHEMES , 2014 .

[31]  Cunsheng Ding,et al.  Binary Linear Codes With Three Weights , 2014, IEEE Communications Letters.

[32]  Cunsheng Ding,et al.  A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing , 2015, IEEE Transactions on Information Theory.

[33]  Keqin Feng,et al.  Linear codes with few weights from inhomogeneous quadratic functions , 2016, Des. Codes Cryptogr..

[34]  James L. Massey,et al.  Minimal Codewords and Secret Sharing , 1999 .

[35]  Cunsheng Ding,et al.  A coding theory construction of new systematic authentication codes , 2005, Theor. Comput. Sci..

[36]  Xiang-dong Hou,et al.  Solution to a problem of S. Payne , 2003 .

[37]  Cunsheng Ding,et al.  Linear codes from perfect nonlinear mappings and their secret sharing schemes , 2005, IEEE Transactions on Information Theory.

[38]  Berry Schoenmakers,et al.  A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic , 1999, CRYPTO.

[39]  Gérard D. Cohen,et al.  Yet another variation on minimal linear codes , 2015, 2015 Information Theory and Applications Workshop (ITA).