Analysis of autocorrelation function of Boolean functions in Haar domain
Design of strong symmetric cipher systems requires that the underlying cryptographic Boolean function meet specific security requirements. Some of the required security criteria can be measured with the help of the autocorrelation function as a tool, while other criteria can be measured using the W...
Main Authors: | Rafiq, Hashum M., Siddiqi, Mohammad Umar |
---|---|
Format: | Conference or Workshop Item |
Language: | English English |
Published: |
The Institute of Electrical and Electronics Engineers, Inc.
2016
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/55718/ http://irep.iium.edu.my/55718/ http://irep.iium.edu.my/55718/1/55718_Analysis%20of%20Autocorrelation%20Function.pdf http://irep.iium.edu.my/55718/7/55718_Analysis%20of%20autocorrelation%20function_Scopus.pdf |
Similar Items
-
Analysis and synthesis of cryptographic Boolean functions in Haar domain: Initial results
by: Rafiq, Hashum Mohamed, et al.
Published: (2012) -
Haar spectrum of Bent Boolean functions
by: Siddiqi, Mohammad Umar, et al.
Published: (2016) -
Haar transformation of linear boolean function
by: Mohamed Rafiq, Hashum, et al.
Published: (2009) -
Correlation immunity and resiliency of boolean functions from haar domain perspective
by: Rafiq, Hashum M., et al.
Published: (2015) -
Haar spectrum based construction of resilient and plateaued boolean functions
by: Rafiq, Hashum M., et al.
Published: (2017)