Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/2927

 Title: Algorithms for Computing the Linearity and Degree of Vectorial Boolean Functions Authors: Bouyuklieva, StefkaBouyukliev, Iliya Keywords: Boolean FunctionWalsh TransformS-BoxLinearityAlgorithms Issue Date: 2016 Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences Citation: Serdica Journal of Computing, Vol. 10, No 3-4, (2016), 245p-262p Abstract: In this article, we study two representations of a Boolean function which are very important in the context of cryptography. We describe Möbius and Walsh Transforms for Boolean functions in details and present effective algorithms for their implementation. We combine these algorithms with the Gray code to compute the linearity, nonlinearity and algebraic degree of a vectorial Boolean function. Such a detailed consideration will be very helpful for students studying the design of block ciphers, including PhD students in the beginning of their research. ACM Computing Classification System (1998): F.2.1, F.2.2. URI: http://hdl.handle.net/10525/2927 ISSN: 1312-6555 Appears in Collections: Volume 10 Number 3-4

Files in This Item:

File Description SizeFormat