In cryptography, the avalanche effect refers to a desirable property of cryptographic algorithms, typically block ciphers and cryptographic hash functions. The avalanche effect is evident if, when an input is changed slightly (for example, flipping a single bit) the output changes significantly (e.g., half the output bits flip). In the case of quality block ciphers, such a small change in either the key or the plaintext should cause a drastic change in the ciphertext. The actual term was first used by Horst Feistel,^{[1]} although the concept dates back to at least Shannon's diffusion.
If a block cipher or cryptographic hash function does not exhibit the avalanche effect to a significant degree, then it has poor randomization, and thus a cryptanalyst can make predictions about the input, being given only the output. This may be sufficient to partially or completely break the algorithm. Thus, the avalanche effect is a desirable condition from the point of view of the designer of the cryptographic algorithm or device.
Constructing a cipher or hash to exhibit a substantial avalanche effect is one of the primary design objectives. This is why most block ciphers are product ciphers. It is also why hash functions have large data blocks. Both of these features allow small changes to propagate rapidly through iterations of the algorithm, such that every bit of the output should depend on every bit of the input before the algorithm terminates.
Contents 
The strict avalanche criterion (SAC) is a generalization of the avalanche effect. It is satisfied if, whenever a single input bit is complemented, each of the output bits changes with a probability of one half. The SAC builds on the concepts of completeness and avalanche and was introduced by Webster and Tavares in 1985.^{[2]}
The bit independence criterion (BIC) states that output bits j and k should change independently when any single input bit i is inverted, for all i, j and k.
The English used in this article or section may not be easy for everybody to understand. You can help Wikipedia by making this page or section simpler. 
hash function has good avalanche effect. When a single bit is changed the hash sum becomes completely different.]]
In cryptography, the avalanche effect refers to an attractive property of block ciphers and cryptographic hash functions algorithms.
The avalanche effect is satisfied if:
Both of above features allow small changes to propagate rapidly through iterations of the algorithm, in such a way that every bit of the output should depend on every bit of the input before the algorithm terminates.
The term avalanche effect was first used by Horst Feistel (Feistel 1973), although the concept was identified by Shannon's property of confusion.
If a block cipher or cryptographic hash function does not exhibit the avalanche effect to a significant degree, then it has poor randomization, and thus a cryptanalyst can make forecasts about the input, if given only the output. This may be sufficient to partially or completely break (crack) the algorithm.
One of the primary design objectives in constructing a "quality" cipher or cryptographic hash function is to build a good avalanche effect. This is why most block ciphers are product ciphers. It is also why hash functions have large data blocks.
Contents 
The Strict Avalanche Criterion (SAC) is a property of boolean functions of importance to cryptography. A function is said to satisfy the strict avalanche criterion if, whenever a single input bit is complemented, each of the output bits should change with a probability of one half.
The SAC was built on the concepts of completeness and avalanche and introduced by Webster and Tavares in 1985.
The Bit independence criterion (BIC) states that output bits j & k should change independently when any single input bit i is inverted, for all i, j and k.
