Bricklayer function
 | This article is actively undergoing a major edit for a little while. To help avoid edit conflicts, please do not edit this page while this message is displayed. This page was last edited at 20:50, 13 April 2023 (UTC) (2 years ago) – this estimate is cached, . Please remove this template if this page hasn't been edited for a significant time. If you are the editor who added this template, please be sure to remove it or replace it with {{Under construction}} between editing sessions. |
In cryptography, the bricklayer function is a part of round function that can be decomposed into identical independent Boolean operations on the partitioned pieces of its input data,[2] so called bundles.[3] The term was introduced by Daemen and Rijmen in 2001.[1]
References
- ^ a b Weinmann 2009, p. 36.
- ^ Daemen & Rijmen 2013, p. 22.
- ^ Daemen & Rijmen 2013, p. 20.
Sources
- Daemen, Joan; Rijmen, Vincent (9 March 2013). "Bricklayer Functions". The Design of Rijndael: AES - The Advanced Encryption Standard (PDF). Springer Science & Business Media. pp. 22–23. ISBN 978-3-662-04722-4. OCLC 1259405449.
- Weinmann, Ralf-Philipp (2009). Algebraic Methods in Block Cipher Cryptanalysis (PDF) (PhD). Technischen Universität Darmstadt.
 | This cryptography-related article is a stub. You can help Wikipedia by expanding it. |