Abstract
The strict avalanche criterion was introduced by Webster and Tavares while studying some cryptographic functions. We say that a binary function ƒ(x), x ∈ Vn, satisfies this criterion if replacing any coordinate of the vector x by its complement changes the values of ƒ(x) exactly in a half of cases. In this paper we establish an upper bound for the number of such functions for n large enough.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
