Skip to main content
Springer Nature Link
Log in

Complementary information set codes over GF(p)

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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)

  2. Cannon J., Playoust C.: An Introduction to Magma. University of Sydney, Sydney (1994)

  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)

  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)

  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)

  6. Harada M., Munemasa A.: Classification of self-dual codes of length 36. Adv. Math. Commun. 6, 229–235 (2012)

  7. Kim J.-L.: New extremal self-dual codes of lengths 36, 38 and 58. IEEE Trans. Inf. Theory 47, 386–393 (2001)

  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)

  9. Kim J.-L., Lee Y.: An efficient construction of self-dual codes. Bull. Korean Math. Soc. 52(3), 915–923 (2015)

  10. Lee Y.: http://math.ewha.ac.kr/~yoonjinl/CIS.pdf

  11. MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. Elsevier, Amsterdam (1981)

  12. Pless V.S., Huffman W.C.: Handbook of Coding Theory. Elsevier, Amsterdam (1998)

  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).

  14. Siegenthaler T.: Correlation-immunity of non-linear combining functions for cryptographic applications. IEEE Trans. Inf. Theory 30(5), 776–780 (1984)

  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)

Download references

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).

Author information

Authors and Affiliations

  1. Institute of Mathematical Sciences, Ewha Womans University, 11-1 Daehyun-Dong, Seodaemun-Gu, Seoul, 120-750, South Korea

    Hyun Jin Kim

  2. Department of Mathematics, Ewha Womans University, 11-1 Daehyun-Dong, Seodaemun-Gu, Seoul, 120-750, South Korea

    Yoonjin Lee

Authors
  1. Hyun Jin Kim
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yoonjin Lee
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Hyun Jin Kim.

Additional information

Communicated by C. Carlet.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, H.J., Lee, Y. Complementary information set codes over GF(p). Des. Codes Cryptogr. 81, 541–555 (2016). https://doi.org/10.1007/s10623-015-0174-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-015-0174-3

Keywords

Mathematics Subject Classification