Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Haar Spectrum based Construction of Resilient and Plateaued Boolean Functions

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
H. M. Rafiq, M. U. Siddiqi

H M Rafiq and M U Siddiqi. Haar Spectrum based Construction of Resilient and Plateaued Boolean Functions. International Journal of Computer Applications 158(5):18-25, January 2017. BibTeX

	author = {H. M. Rafiq and M. U. Siddiqi},
	title = {Haar Spectrum based Construction of Resilient and Plateaued Boolean Functions},
	journal = {International Journal of Computer Applications},
	issue_date = {January 2017},
	volume = {158},
	number = {5},
	month = {Jan},
	year = {2017},
	issn = {0975-8887},
	pages = {18-25},
	numpages = {8},
	url = {},
	doi = {10.5120/ijca2017912827},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}


Stream cipher systems are considered desirable and secure if composed of Boolean functions (B.Fs) that are characterized by high resiliency. Resiliency is one of the main cryptographic security criteria for a given Boolean function. One of the classes of functions satisfying high resiliency with desirable cryptographic properties include the Plateaued functions whose design construction is of significant interest. The main known methods for these functions’ construction are based on the Walsh spectrum or the related truth table concatenations if not algebraic methods. This paper examines the Haar spectral transform as an alternative method for the design of such functions. As its contribution, the paper presents different methods utilizing the Haar spectral coefficients’ distribution for the design of highly resilient functions including Plateaued functions. The paper presents two methods of approaches namely; design of resilient BFs within the current variable domain without considering lower variable domains and using the lower variable domains to construct resilient functions within the higher variable domain. In the process, a Haar based construction method of


  1. C. W. Thomas and S. Pantelimon. 2009. Cryptographic Boolean Functions and Applications, Academic Press, Elseveir Inc.
  2. C. Carlet, 2010. Boolean Functions for Cryptography and Error Correcting Codes. In In Crama, Y. & Hammer, P. L. (eds.) Chapter of the monograph  Boolean Models and Methods in Mathematics, Computer Science and Engineering, Cambridge University Press, pp.257–397.
  3. R. Kui, P. Jaemin and K. Kwangjo. 2005. “On the Construction of Cryptographically Strong Boolean Functions with Desirable Trade-off,” Journal of Zhejiang University Science, vol. 6, No. 5, pp. 358–364, doi:10.1361/jzus.2005.A0358.
  4. M. Read. 2007. Explicable Boolean Functions, Dissertation submitted in part fulfillment for the degree of MEng. In Computer Systems and Software Engineering, Department of Computer Science, The University of York.
  5. M. G. Karpovsky, R. S. Stanković and J. T. Astola. 2008. Spectral Logic and Its Applications for the Design of Digital Devices, John Wiley & Sons Inc.
  6. R. S. Stanković and B. J. Falkowski. 2003. “The Haar Wavelet Transform: Its Status and Achievement,” Computers and Electrical Engineering, vol. 29, No. 1, pp. 25-44, doi:10.1016/S0045-7906(01)00011-8.
  7. B. J. Falkowski and S. Rahardja. 1996. “Walsh-like Functions and their Relations,” Proc. IEE Vision, Image and Signal Processing, vol. 143, No. 5, pp. 279-284, doi:1049/ip-vis:19960760.
  8. B. J. Falkowski and T. Sasao. 2005. “Unified Algorithm to Generate Walsh Functions in Four Different Orderings and Its Programmable Hardware Implementations,” Proc. IEE Vision, Image and Signal Processing., vol. 152, no. 6, pp. 819-826, doi:10.1049/ip-vis:20045123.
  9. B. J. Fino. 1972. “Relations Between Haar and Walsh/Hadamard Transforms,” Proc. IEEE, vol. 60, no. 5, pp. 647-648, doi:10.1109/PROC.1972.8719.
  10. S. Khuri. 1997. Computing with Haar Functions. Proc. 1997 Symposium on Applied Computing, 1997, pp. 223-227, doi:10.1145/331697.331744.
  11. H. M. Rafiq and M. U. Siddiqi. 2009. Haar Transformation of Linear Boolean Functions, Proc. IEEE International Conference on Signal Processing Systems, pp. 802-805, Singapore, doi:10.1109/ICSPS.2009.150.
  12. M. A. Thornton, D. M. Miller and R. Drechsler. 2001. Transformations Amongst the Walsh, Haar, Arithmetic and Reed-Muller Spectral Domains, Proc. 4th Intl. Workshop on Applications of Reed-Muller Expansion in Circuit Design, pp. 215-225, doi:
  13. H. M. Rafiq and M. U. Siddiqi. 2015. “Correlation Immunity and Resiliency of Boolean Functions from Haar Domain Perspective,” ARPN Journal of Engineering and Applied Sciences, vol. 10, no. 22, pp. 17232-17238, ISSN 1819-6608.
  14. S. Gao, W. Ma, Y. Zhao, & Z. Zhuo. 2011. “Walsh Spectrum of Cryptographically Concatenating Functions and its Application in Constructing Resilient Boolean Functions”, Journal of Computational Information Systems, 7(4), pp. 1074-1081.
  15. A. Canteaut & M. Trabbia. 2000. Improved Fast Correlation Attacks using Parity-Check Equations of weight 4 and 5. In Advances in Cryptology—EUROCRYPT 2000. Springer Berlin Heidelberg, 2000, pp. 573-588.
  16. Canteaut, A. 2002, October. On the correlations between a combining function and functions of fewer variables. In Information Theory Workshop, 2002. Proceedings of the 2002 IEEE (pp. 78-81). IEEE.
  17. Charpin, P., & Pasalic, E. 2003, January. On propagation characteristics of resilient functions. In Selected Areas in Cryptography (pp. 175-195). Springer Berlin Heidelberg


Cryptographic Boolean Functions, Haar/Walsh Transforms, Haar Spectrum, Spectral Coefficients, Cryptographic Security Criteria, Construction Methods and Resiliency.