Designs, Codes and Cryptography

, Volume 81, Issue 3, pp 541–555 | Cite as

Complementary information set codes over GF(p)

Article
First Online:
Received:
Revised:
Accepted:

Abstract

Complementary information set codes (CIS codes) over a finite field GF(p) are closely connected to correlation-immune functions over GF(p), which are important cryptographic functions, where p is an odd prime. Using our CIS codes over GF(p) of minimum weight \(d+1\), we can obtain p-ary correlation-immune function of strength d. We find an efficient method for constructing CIS codes over GF(p). We also find a criterion for checking equivalence of CIS codes over GF(p). We complete the classification of all inequivalent CIS codes over GF(p) of lengths up to 8 for \(p = 3,5,7\) using our construction and criterion. We also find their weight enumerators and the order of their automorphism groups. The class of CIS codes over GF(p) includes self-dual codes over GF(p) as its subclass, and some CIS codes are formally self-dual codes as well; we sort out our classification results. Furthermore, we show that long CIS codes over GF(p) meet the Gilbert–Vashamov bound.

Keywords

Code Complementary information set code Correlation immune Self-dual code Equivalence Gilbert–Vashamov bound 

Mathematics Subject Classification

94B05 11T71 
This is a preview of subscription content, log in to check access.

Notes

Acknowledgments

The authors are grateful to anonymous referees and a handling editor for their careful review and constructive suggestions for improvement of our manuscript. The authors were supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (MEST) (2014-002731), the first named author was also supported by the National Research Foundation of Korea (NRF) Grant founded by the Korea government (NRF-2013R1A1A2063240), and the second named author by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2009-0093827).

References

  1. 1.
    Camion P., Canteaut A.: Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography. Des. Codes Cryptogr. 16(2), 121–149 (1999)Google Scholar
  2. 2.
    Cannon J., Playoust C.: An Introduction to Magma. University of Sydney, Sydney (1994)Google Scholar
  3. 3.
    Carlet C.: More correlation-immune and resilient functions over galois fields and galois rings. In: Advances in Cryptology—EUROCRYPT’97. Lecture Note in Computer Sciences, vol. 1233, pp. 422-433. Springer, New York (1997)Google Scholar
  4. 4.
    Carlet C., Gaborit P., Kim J.-L., Solé P.: A new class of codes for Boolean masking of cryptographic computations. IEEE Trans. Inf. Theory 58, 6000–6011 (2012)Google Scholar
  5. 5.
    Carlet C., Freibert F., Guilley S., Kiermaier M., Kim J.-L., Solé P.: Higher-order CIS codes. IEEE Trans. Inf. Theory 60(9), 5283–5295 (2014)Google Scholar
  6. 6.
    Harada M., Munemasa A.: Classification of self-dual codes of length 36. Adv. Math. Commun. 6, 229–235 (2012)Google Scholar
  7. 7.
    Kim J.-L.: New extremal self-dual codes of lengths 36, 38 and 58. IEEE Trans. Inf. Theory 47, 386–393 (2001)Google Scholar
  8. 8.
    Kim J.-L., Lee Y.: Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Combin. Theory Ser. A 105(1), 79–95 (2004)Google Scholar
  9. 9.
    Kim J.-L., Lee Y.: An efficient construction of self-dual codes. Bull. Korean Math. Soc. 52(3), 915–923 (2015)Google Scholar
  10. 10.
  11. 11.
    MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. Elsevier, Amsterdam (1981)Google Scholar
  12. 12.
    Pless V.S., Huffman W.C.: Handbook of Coding Theory. Elsevier, Amsterdam (1998)Google Scholar
  13. 13.
    Schnorr C.P., Vaudenay S.: Black box cryptanalysis of hash networks based on multipermutations. In: Advances in Cryptology—EUROCRYPT’94. Lecture Note in Computer Science 950, pp. 47–57. Springer, New York (1995).Google Scholar
  14. 14.
    Siegenthaler T.: Correlation-immunity of non-linear combining functions for cryptographic applications. IEEE Trans. Inf. Theory 30(5), 776–780 (1984)Google Scholar
  15. 15.
    Yildiz B., Ozger Z.O.: A generalization of the Lee weight to \({\mathbb{Z}}_{p^{k}}\). TWMS J. Appl. Eng. Math 2(2), 145–153 (2012)Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Institute of Mathematical SciencesEwha Womans UniversitySeoulSouth Korea
  2. 2.Department of MathematicsEwha Womans UniversitySeoulSouth Korea

Personalised recommendations