Analysis and synthesis of cryptographic Boolean functions in Haar domain: Initial results
Boolean functions play a central role in the design of information protection systems. The strength of cryptographic systems against any potential attack is determined by several criteria which the cryptographic functions should meet. These criteria can be analyzed and measured through the aid o...
Main Authors: | Rafiq, Hashum Mohamed, Siddiqi, Mohammad Umar |
---|---|
Format: | Conference or Workshop Item |
Language: | English English |
Published: |
International Islamic University Malaysia
2012
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/28314/ http://irep.iium.edu.my/28314/ http://irep.iium.edu.my/28314/ http://irep.iium.edu.my/28314/1/28314_Analysis%20and%20synthesis_conference.pdf http://irep.iium.edu.my/28314/2/28314_Analysis%20and%20synthesis_SCOPUS.pdf |
Similar Items
-
Analysis of autocorrelation function of Boolean functions in Haar domain
by: Rafiq, Hashum M., et al.
Published: (2016) -
Correlation immunity and resiliency of boolean functions from haar domain perspective
by: Rafiq, Hashum M., et al.
Published: (2015) -
Haar transformation of linear boolean function
by: Mohamed Rafiq, Hashum, et al.
Published: (2009) -
Haar spectrum of Bent Boolean functions
by: Siddiqi, Mohammad Umar, et al.
Published: (2016) -
Cryptographic boolean functions: transform domain perspective
by: Mohamed Rafiq, Hashum, et al.
Published: (2011)