Almost Boolean functions: The design of Boolean functions by spectral inversion

Computational Intelligence

Volumn 20, Issue 3, 2004, Pages 450-462

  Clark, John A ^a   Jacob, Jeremy L ^a   Maitra, Subhamoy ^b   Stǎnicǎ, Pantelimon ^c  

^a UNIVERSITY OF YORK   (United Kingdom)

^b INDIAN STATISTICAL INSTITUTE   (India)

^c AUBURN UNIVERSITY AT MONTGOMERY   (United States)

Author keywords

Autocorrelation; Boolean functions; Correlation immunity; Nonlinearity; Rotational symmetry; Simulated annealing

Indexed keywords

BOOLEAN FUNCTIONS; CRYPTOGRAPHY; HEURISTIC METHODS; INFORMATION THEORY; SIMULATED ANNEALING;

AUTOCORRELATION; CORRELATION IMMUNITY; ROTATIONAL SYMMETRY;

SECURITY OF DATA;

EID: 4344630715     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.0824-7935.2004.00245.x     Document Type: Article

References (24)

1. CARLET, C., and P. SARKAR. 2002. Spectral domain analysis of correlation immune and resilient Boolean functions. Finite Fields and Its Applications, 8(1):120-130.
2. CLARK, J. A., and J. L. JACOB. 2000. Two-stage optimization in the design of Boolean functions. In ACISP 2000, Lecture Notes in Computer Science, Vol. 1841, Springer-Verlag, Berlin, pp. 242-254.
3. CLARK, J. A., J. L. JACOB, S. STEPNEY, S. MAITRA, and W. MILLAN. 2002. Evolving Boolean functions satisfying multiple criteria. In INDOCRYPT 2002, Lecture Notes in Computer Science, Vol. 2551, Springer Verlag, Berlin, pp. 246-259.
4. CUSICK, T. W., and P. STǍNICǍ. 2002. Fast evaluation, weights and nonlinearity of rotation-symmetric functions. Discrete Mathematics, 258(1-3):289-301.
5. DING, C., G. XIAO and W. SHAN. 1991. The stability theory of stream ciphers. In Lecture Notes in Computer Science, Vol. 561, Springer-Verlag, Berlin.
6. FILLIOL, E., C. FONTAINE, and D. VIANNE. 2001. A new fast block cipher design: COS ciphers. In Proceedings of the International Symposium on Information Theory 2001.
7. KIRKPATRICK, S., JR., C. D. GELATT, and M. P. VECCHI. 1983. Optimization by simulated annealing. Science, 220(4598):671-680.
8. MAITRA, S., and E. PASALIC. 2002. Further constructions of resilient Boolean functions with very high nonlinearity. IEEE Transactions on Information Theory, 48(7): 1825-1834.
9. MAITRA, S., and P. SARKAR. 2002. Cryptographically significant Boolean functions with five-valued walsh spectra. Theoretical Computer Science, 276(1 and 2):133-146.
10. MAITY, S., and T. JOHANSSON. 2002. Construction of Cryptographically important Boolean functions. In INDOCRYPT 2002, Lecture Notes in Computer Science, Vol. 2551, Springer-Verlag, Berlin, pp. 234-245.
11. MATSUI, M. 1993. Linear cryptanalysis method for DES cipher. In Advances in Cryptology - EuroCrypt'93, Lecture Notes in Computer Science, Vol. 765, Springer-Verlag, Berlin, pp. 386-397.
12. MILLAN, W., A. CLARK, and E. DAWSON. 1997. An effective genetic algorithm for finding highly nonlinear Boolean functions. In First International Conference on Information and Communications Security, Lecture Notes in Computer Science, Vol. 1334, Springer-Verlag, Berlin, pp. 149-158.
13. MILLAN, W., A. CLARK, and E. DAWSON. 1998. Heuristic design of cryptographically strong balanced Boolean functions. In Advances in Cryptology EUROCRYPT'98, LNCS, Vol. 1403, Springer-Verlag, Berlin, pp. 489-499.
14. MILLAN, W., A. CLARK, and E. DAWSON. 1999. Boolean function design using hill climbing methods. In Fourth Australasian Conference on Information, Security and Privacy, April 1999. Lecture Notes in Computer Science, Vol. 1587, Springer-Verlag, Berlin, pp. 1-11.
15. PASALIC, E., S. MAITRA, T. JOHANSSON, and P. SARKAR. 2001. New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity. In Workshop on Coding and Cryptography - WCC 2001, Paris, January 8-12, 2001. Electronic Notes in Discrete Mathematics, Vol. 6, Elsevier Science, Amsterdam.
16. PIEPRZYK, J., and C. X. QU. 1999. Fast hashing and rotation-symmetric functions. Journal of Universal Computer Science, 5(1):20-31.
17. SARKAR, P., and S. MAITRA. 2000a. Construction of nonlinear Boolean functions with important cryptographic properties. In Advances in Cryptology - EUROCRYPT 2000, May 2002. Lecture Notes in Computer Science, Vol. 1807, Springer-Verlag, Berlin, pp. 485-506.
18. SARKAR, P., and S. MAITRA. 2000b. Nonlinearity bounds and constuction of resilient Boolean functions. In Advances in Cryptology - Crypto 2000, Berlin. Lecture Notes in Computer Science, Vol. 1880, Edited by M. Bellare. Springer-Verlag, Berlin, pp. 515-532.
19. STǍNICǍ, P., and S. MAITRA. 2002. Rotation symmetric Boolean functions - Count and cryptographic properties. In R. C. Bose Centenary Symposium on Discrete Mathematics and Applications, December 2002, Indian Statistical Institute, Calcutta and Technical Report of Cryptology Research Group, Indian Statistical Institute, Technical Report Number CRG/2002/10, November 18, 2002. Also available at http://www.isical.ac.in/~crg/tech-reports. html.
20. STǍNICǍ, P., S. MAITRA, and J. A. CLARK. 2004. Results on rotation symmetric bent and correlation immune Boolean functions. In Fast Software Encryption 2004, Edited by B. Roy and S. Maitra. February 2004, Delhi.
21. TARANNIKOV, Y. V. 2000. On resilient Boolean functions with maximum possible nonlinearity. In Progress in Cryptology - INDOCRYPT 2000, Lecture Notes in Computer Science, Vol. 1977, Springer-Verlag, Berlin, pp. 19-30.
22. ZHANG, X-M., and Y. ZHENG. 1995. GAC - The criterion for global avalanche characteristics of cryptographic functions. Journal of Universal Computer Science, 1(5):316-333.
23. ZHENG, Y., and X. M. ZHANG. 2000. Improved upper bound on the nonlinearity of high order correlation immune functions. In Selected Areas in Cryptography - SAC 2000, Lecture Notes in Computer Science, Vol. 2012, Springer-Verlag, Berlin, pp. 264-274.
24. XIAO, G. Z., and J. L. MASSEY. 1988. A spectral characterization of correlation immune combining functions. IEEE Transactions on Information Theory, 34(3):569-571.