Designs, Codes and Cryptography

, Volume 37, Issue 2, pp 319–346 | Cite as

Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces

  • Pascale CharpinEmail author
  • Enes Pasalic


Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions ((n, m, t) functions) by using a class of binary disjoint codes, a construction which was introduced in IEEE Trans. Inform. Theory, Vol. IT-49 (2) (2003). Our main contribution concerns the generation of suitable sets of such disjoint codes. We propose a deterministic method for finding disjoint codes of length ν m by considering the points of PG\((v-1, \mathbb{F}_{2^{m}}\)). We then obtain some lower bounds on the number of disjoint codes, by fixing some parameters. Through these sets, we deduce in certain cases the existence of resilient functions with very high nonlinearity values. We show how, thanks to our method, the degree and the differential properties of (n, m, t) functions can be improved.


Boolean function n-input m-output function resilient function nonlinearity propagation characteristic symmetric cryptography stream cipher linear code projective space complete weight enumerator 

AMS Classification:



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Bierbrauer, K. Gopalakrishnan and R. D. Stinson, Bounds for resilient functions and orthogonal arrays. In Advances in Cryptology—CRYPTO’94., vol. LNCS 839, Springer-Verlag (1994) pp. 247–256Google Scholar
  2. 2.
    Bennet, C.H., Brassard, G., Robert, J.M. 1988Privacy amplification by public discussionSIAM Journal on Computing.24210229CrossRefGoogle Scholar
  3. 3.
    P. Camion, C. Carlet, P. Charpin and N. Sendrier, On correlation-immune functions. In Advances in Cryptology—EUROCRYPT’91., Vol. LNCS 547, Springer-Verlag (1991) pp. 86–100Google Scholar
  4. 4.
    C. Carlet, On the coset weight divisibility and nonlinearity of resilient and correlation-immune functions. In Sequences and their Applications - SETA ’01., Discrete Mathematics and Theoretical Computer Science., Springer-Verlag (2001) pp. 131–144Google Scholar
  5. 5.
    C. Carlet, A larger class of cryptographic Boolean functions via a study of the Maiorana-McFarland construction In Advances in Cryptology - CRYPT0 2002., Lecture Notes in Computer Science, 2442, pp. 549–564Google Scholar
  6. 6.
    P. Charpin and E. Pasalic, On propagation characteristics of resilient functions. In Selected Areas in Cryptography—SAC 2002., LNCS, 2595, Springer-Verlag (2003) pp. 356–365Google Scholar
  7. 7.
    S. Chee, S. Lee, D. Lee and H. S. Sung, On the correlation immune functions and their nonlinearity. In Advances in Cryptology—ASIACRYPT’96., Vol. LNCS, 1163, Springer-Verlag (1996) pp. 232–243.Google Scholar
  8. 8.
    J. H. Cheon, Nonlinear vector resilient functions In Advances in Cryptology—CRYPTO 2001., Vol. LNCS, 2139, Springer-Verlag (2001) pp. 181–195Google Scholar
  9. 9.
    B. Chor, O. Goldreich, J. Hastad, J. Friedman, S Rudich and R. Smolensky, The bit extraction problem or t-resilient functions. In 26th IEEE Symposium on Foundations of Computer Science., (1985) pp. 396–407Google Scholar
  10. 10.
    G. Xiao, C. Ding and W. Shan, The Stability Theory of Stream Ciphers., Vol. LNCS, 561 Springer-Verlag (1991)Google Scholar
  11. 11.
    H. Dobbertin, Construction of bent functions and balanced Boolean functions with high nonlinearity. In Fast Software Encryption, Cambridge Security Workshop., Vol. LNCS, 1008, Springer-Verlag (1994) pp. 61–74Google Scholar
  12. 12.
    J. Friedman, On the bit extraction problem. In 33rd IEEE Symposium on Foundations of Computer Science., (1982) pp. 314–319Google Scholar
  13. 13.
    Gopalakrishnan, K., Stinson, R.D. 1995Three characterization of nonbinary correlation immune and resilient functionsDes. Codes Cryptogr.5241251CrossRefGoogle Scholar
  14. 14.
    K. C. Gupta and P. Sarkar, Improved constructions of nonlinear resilient S-boxes. In Advances in Cryptology—ASIACRYPT 2002., Vol. LNCS, 2501, Springer-Verlag (2002) pp. 466–483Google Scholar
  15. 15.
    T. Johansson and E. Pasalic, A construction of resilient functions with high nonlinearity, IEEE Trans. on Inform. Theory., IT-49(2) (2003)Google Scholar
  16. 16.
    Kurosawa, K., Satoh, T., Yamamoto, K. 1997Highly nonlinear t-resilient functionsJournal of Universal Computer Science.3721729Google Scholar
  17. 17.
    Lidl, R., Niederreiter, H. 1983Finite Fields, Encyclopedia of Mathematics and its Applications, Vol. 20.Cambridge University PressCambridgeGoogle Scholar
  18. 18.
    Macwilliams, F.J., Sloane, N.J.A. 1977The Theory of Error-Correcting CodesNorth-HollandAmsterdamGoogle Scholar
  19. 19.
    W. Meier and O. Staffelbach, Nonlinearity criteria of cryptographic functions. In Advances in Cryptology—EUROCRYPT’88., Vol. LNCS, 330, Springer-Verlag (1988) pp. 549–562Google Scholar
  20. 20.
    Menezes, A., Oorschot, P., Vanstone, S. 1997Handbook of Applied CryptographyCRC PressBoca RatonGoogle Scholar
  21. 21.
    K. Nyberg, On the construction of highly nonlinear permutations. In Advances in Cryptology—EUROCRYPT’92., Vol. LNCS 658, Springer-Verlag (1992) pp. 92–98Google Scholar
  22. 22.
    Pasalic, E., Maitra, S. 2002Linear codes in generalized construction of resilient functions with very high nonlinearityIEEE Trans. Inform. Theory. Vol. IT.4821822191CrossRefGoogle Scholar
  23. 23.
    Patterson, N.J., Wiedemann, D.H. 1983The covering radius of the (215, 16) Reed-Muller code is at least 16276, IEEE Trans. on InformTheory. Vol. IT.29354356Google Scholar
  24. 24.
    Patterson, N.J., Wiedemann, D.H. 1990Correction to – the covering radius of the (215, 16) Reed-Muller code is at least 16276, IEEE Trans  Google Scholar
  25. 25.
    Rothaus, O.S. 1976On bent functionsJ. Combin Theory, Series A.20300305Google Scholar
  26. 26.
    P. Sarkar and S. Maitra, Construction of nonlinear Boolean functions with important cryptographic properties. In Advances in Cryptology—EUROCRYPT 2000., Vol. LNCS 1807, Springer-Verlag (2000) pp. 485–506Google Scholar
  27. 27.
    P. Sarkar and S. Maitra, Nonlinearity bounds and constructions of resilient Boolean functions. In Advances in Cryptology—CRYPTO 2000., Vol. LNCS 1880, Springer-Verlag (2000) pp. 515–532Google Scholar
  28. 28.
    Siegenthaler, T. 1984Correlation-immunity of nonlinear combining functions for cryptograpic applicationsIEEE Trans. Inform. Theory. Vol. IT.30776780CrossRefGoogle Scholar
  29. 29.
    Siegenthaler, T. 1985Decrypting a class of stream ciphers using cipher-text onlyIEEE Trans. Computers., Vol. C.348185Google Scholar
  30. 30.
    Stinson, D.R. 1993Resilient functions and large sets of orthogonal arraysIn Congressus Numeranitium.92105110Google Scholar
  31. 31.
    Y. Tarannikov, On resilient Boolean functions with maximal possible nonlinearity. In Proceedings of Indocrypt., Vol. LNCS 1977, Springer-Verlag (2000) pp. 19–30Google Scholar
  32. 32.
    Zhang, X.M., Zheng, Y. 1997Cryptographically resilient functionsIEEE Trans. Inform. Theory., Vol IT.4317401747Google Scholar
  33. 33.
    Xiao, G.-Z., Massey, J.L. 1988A spectral characterization of correlation-immune combining functionsIEEE Trans. Inform. Theory. Vol. IT.4569571CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  1. 1.INRIA, project CODESDomaine de Voluceau, RocquencourtCedexFrance

Personalised recommendations