Bricklayer function
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
is a notable example of a bricklayer function: each 8-bit bundle of the 128-bit state is undergoing the same S-box transformation independently In cryptography, the bricklayer function is a part of a round function that can be decomposed into identical independent Boolean operations on the partitioned pieces of its input data, so called bundles. The term was introduced by Daemen and Rijmen in 2001. If the underlying function transforming the bundle is nonlinear, it is traditionally called an S-box. If the function is linear, Daemen and Rijmen use for it the term D-box (after diffusion).
is a notable example of a bricklayer function: each 8-bit bundle of the 128-bit state is undergoing the same S-box transformation independently In cryptography, the bricklayer function is a part of a round function that can be decomposed into identical independent Boolean operations on the partitioned pieces of its input data, so called bundles. The term was introduced by Daemen and Rijmen in 2001. If the underlying function transforming the bundle is nonlinear, it is traditionally called an S-box. If the function is linear, Daemen and Rijmen use for it the term D-box (after diffusion). ==References== ==Sources==
Text derived from https://en.wikipedia.org/w/index.php?oldid=1217600549 under CC BY-SA 4.0; modifications have been made.