Skip to main content
SpringerLink
Log in

Vectorial resilient PC(l) of order k Boolean functions from AG-codes

  • Published:
Chinese Annals of Mathematics, Series B Aims and scope Submit manuscript

Abstract

Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1–4, 7, 8, 1, 11, 16]). Kurosawa, Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh’s construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.

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

Access this article

Log in via an institution

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. Carlet, C., On the propagation criterion of degree l and order k, Advances in Cryptology, Lecture Notes in Computer Science, 1403, Springer-Verlag, Berlin, Heidelberg, New York, 1998, 462–474.

    Google Scholar 

  2. Carlet, C., Boolean Functions for Cryptography and Error Correcting Codes, Boolean Methods and Models, Y. Crama and P. Hammer (eds.), Cambridge University Press, Cambridge, 2010, in press.

    Google Scholar 

  3. Carlet, C., Vectorial Boolean functions for cryptography, Boolean Methods and Models, Y. Crama and P. Hammer (eds.), Cambridge University Press, Cambridge, to appear.

  4. Cheon, J. H., Nonlinear vector Boolean functions, Advances in Cryptology, Lecture Notes in Computer Science, 2139, Springer-Verlag, Berlin, Heidelberg, New York, 2001, 458–469.

    Google Scholar 

  5. Garcia, A. and Stichtenoth, H., On the asymptotic behaviour of some towers of function fields over finite fields, J. Number Theory, 61, 1996, 248–273.

    Article  MATH  MathSciNet  Google Scholar 

  6. Grassl, M., Geiselmann, W. and Beth, T., Quantum Reed-Solomon codes, Proc. AAECC 13, Lecture Notes in Computer Science, 1719, M. Fossoreier, H. Imai, S. Lin and A. Poli (eds.), Springer-Verlag, New York, 1996, 231–244.

    Google Scholar 

  7. Johansson, T. and Pasalic, E., A construction of resilient functions with high nonlinearity, IEEE Trans. Inf. Theory, 49(2), 2002, 494–501.

    Article  MathSciNet  Google Scholar 

  8. Kurosawa, K. and Satoh, T., Design of SAC/PC(l) of order k Boolean functions and three other cryptographic criteria, Advances in Cryptology, Lecture Notes in Computer Science, 1233, Springer-Verlag, Berlin, Heidelberg, New York, 1997, 434–449.

    Google Scholar 

  9. Matsumoto, R., Kurosawa, K., Itoh, T., et al, Primal-dual distance bounds of linear codes with applications to cryptography, IEEE Trans. Inf. Theory, to appear. Cryptology e-print 194/2005

  10. Meier, W. and Staffelbach, O., Nonlinearity criteria for cryptographic functions, Advances in Cryptology, Lecture Notes in Computer Science, 434, Springer-Verlag, Berlin, Heidelberg, New York, 1989, 549–562.

    Google Scholar 

  11. Preneel, B., Govaerts, R. and Vandevalle, J., Boolean functions satisfying high order propagation criteria, Advances in Cryptology, Lecture Notes in Computer Science, 473, Springer-Verlag, Berlin, Heidelberg, New York, 1990, 161–173.

    Google Scholar 

  12. Stichtenoth, H., Algebraic Function Fields and Codes, Springer-Verlag, Berlin, 1993.

    MATH  Google Scholar 

  13. Tsfasman, M. A. and Vladut, S. G., Algebraic-Geometric Codes, Kluwer, Dordrecht, 1991.

    MATH  Google Scholar 

  14. van der Geer, G. and van der Vludgt, M., Tables of curves with many points. http://www.science.uva.nl/geer/

  15. van Lint, J. H., Introduction to coding theory, 3rd ed., Springer-Verlag, Berlin, 1999.

    MATH  Google Scholar 

  16. Webster, A. and Tavares, S., On the design of S-boxes, Advances in Cryptology, Lecture Notes in Computer Science, 218, Springer-Verlag, Berlin, Heidelberg, New York, 1985, 523–534.

    Google Scholar 

  17. Zhang, X. M. and Zheng, Y., Cryptographically resilient functions, IEEE Transactions on Information Theory, 43(5), 1997, 1740–1747.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering Institute, East China Normal University, Shanghai, 200062, China

    Hao Chen

  2. Institute of Systems Science, University of Shanghai for Science and Technology, Shanghai, 200093, China

    Liang Ma

  3. Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai, 200030, China

    Jianhua Li

Authors
  1. Hao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liang Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianhua Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hao Chen.

Additional information

Project supported by the National Natural Science Foundation of China (No. 10871068), the joint grant of the Danish National Research Foundation and the National Natural Science Foundation of China and the Shanghai Leading Academic Discipline Project (No. S30504).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H., Ma, L. & Li, J. Vectorial resilient PC(l) of order k Boolean functions from AG-codes. Chin. Ann. Math. Ser. B 32, 99–104 (2011). https://doi.org/10.1007/s11401-010-0621-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11401-010-0621-4

Keywords

2000 MR Subject Classification

Search

Navigation