Haar transformation of linear boolean function
Haar transform is known to have the smallest computational requirement with a considerable interest and attraction drawn towards its spectral properties of Boolean functions. This paper presents Haar transform of Linear Boolean functions, where by the discussion is based on the transformation f...
Main Authors: | Mohamed Rafiq, Hashum, Siddiqi, Muhammad Umar |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/6506/ http://irep.iium.edu.my/6506/ http://irep.iium.edu.my/6506/1/Haar_Transformation_of_Linear_Boolean_Function.pdf |
Similar Items
-
Haar spectrum of Bent Boolean functions
by: Siddiqi, Mohammad Umar, et al.
Published: (2016) -
Analysis of autocorrelation function of Boolean functions in Haar domain
by: Rafiq, Hashum M., et al.
Published: (2016) -
Haar spectrum based construction of resilient and plateaued boolean functions
by: Rafiq, Hashum M., et al.
Published: (2017) -
Analysis and synthesis of cryptographic Boolean functions in Haar domain: Initial results
by: Rafiq, Hashum Mohamed, et al.
Published: (2012) -
Correlation immunity and resiliency of boolean functions from haar domain perspective
by: Rafiq, Hashum M., et al.
Published: (2015)