A construction of resilient functions with high nonlinearity

IEEE Transactions on Information Theory

Volumn 49, Issue 2, 2003, Pages 494-501

  Johansson, Thomas ^a   Pasalic, Enes ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Boolean functions; Correlation immunity; Nonlinearity; Resiliency; Stream ciphers

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; PROBLEM SOLVING; SET THEORY;

CORRELATION IMMUNITY;

BOOLEAN FUNCTIONS;

EID: 0037319586     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.807297     Document Type: Article

References (20)

1. B. I. Bennett, G. Brassard, and J. M. Robert, "Privacy amplification by public discussion," SIAM J. Comput., vol. 17, pp. 210-229, 1988.
2. J. Bierbrauer, K. Gopalakrishnan, and D. R. Stinson, "Bounds on resilient functions and orthogonal arrays," in Advances in Cryptology - CRYPTO'94 (Lecture Notes in Computer Science). New York: Springer-Verlag, 1994, vol. 839, pp. 247-256.
3. P. Camion, C. Carlet, P. Charpin, and N. Sendrier, "On correlation-immune functions," in Advances in Cryptology - CRYPTO'91 (Lecture Notes in Computer Science). New York: Springer-Verlag, 1997, vol. 1233, pp. 422-433.
4. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, "The bit extraction problem or t-resilient functions," in Proc. 26th IEEE Symp. Foundations of Computer Science, 1985, pp. 396-407.
5. S. Chee, S. Lee, D. Lee, and S. H. Sung, "On the correlation immune functions and their nonlinearity," in Advances in Cryptology - ASI-ACRYPT '96 (Lecture Notes in Computer Science). New York: Springer-Verlag, 1996, vol. 1163, pp. 232-243.
6. B. Chor, O. Goldreich, J. Hstad, J. Friedman, S. Rudich, and R. Smolensky, "The bit extraction problem or t-resilient functions," in Proc. IEEE Symp. Foundations of Computer Science, 1986, pp. 396-407.
7. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
8. K. Gopalakrishnan, "A study of Correlation-immune, resilient and related cryptographic functions," Ph.D. dissertation, Univ. Nebraska, 1994.
9. X. Guo-Zhen and J. Massey, "A spectral characterization of correlation immune combining functions," IEEE Trans. Inform. Theory, vol. 34, pp. 569-571, May 1988.
10. J. Friedman, "On the bit extraction problem," in Proc. 33rd IEEE Symp. Foundations of Computer Science, 1982, pp. 314-319.
11. F. J. MacWillams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
12. J. W. Hirschfeld, Projective Geometry Over Finite Fields. New York: Oxford Univ. Press, 1979.
13. K. Kurosawa, T. Satoh, and K. Yamamoto, "Highly nonlinear t-resilient functions," J. UniverComputer Sci., vol. 3, no. 6, pp. 721-729, 1997.
14. S. Maitra and P. Sarkar, "Construction of nonlinear Boolean functions with important cryptographic properties," in Advances in Cryptology - EUROCRYPT'00 (Lecture Notes in Computer Science). New York: Springer-Verlag, 2000, vol. 1807, pp. 491-512.
15. K. Nyberg, "On the construction of highly nonlinear permutations," in Advances in Cryptology - EUROCRYPT'92 (Lecture Notes in Computer Science). New York: Springer-Verlag, 1992, vol. 658, pp. 92-98.
16. J. Seberry, X. M. Zhang, and Y. Zheng, "On constructions and nonlinearity of correlation immune Boolean functions," in Advances in Cryptology - EUROCRYPT'93 (Lecture Notes in Computer Science). New York: Springer-Verlag, 1993, vol. 765, pp. 181-199.
17. T. Siegenthaler, "Correlation-immunity of nonlinear combining functions for cryptographic applications," IEEE Trans. Inform. Theory, vol. IT-30, pp. 776-780, Sept. 1984.
18. D. R. Stinson, "Resilient functions and large sets of orthogonal arrays," Congressus Numerantium, vol. 92, pp. 105-110, 1993.
19. D. R. Stinson and J. L. Massey, "An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions," in Journal of Cryptology (Lecture Notes in Computer Science). New York: Springer-Verlag, 1994, vol. 765, pp. 181-199.
20. X. M. Zhang and Y. Zheng, "Cryptographically resilient functions," IEEE Trans. Inform. Theory, vol. 43, pp. 1740-1747, Sept. 1997.