Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Checking normality of Boolean functions

In: Tatra Mountains Mathematical Publications, vol. 33, no. 1
Krzysztof Nowak
Detaily:
Rok, strany: 2006, 99 - 112
O článku:
Besides nonlinearity and correlation immunity, normality is another criterion for cryptographic Boolean functions. A Boolean function is called normal if it is constant on a coset of a vector subspace. There are no known general mathematical methods for checking normality of Boolean functions, so we have to use computer algorithms. In this paper we present an algorithm for checking normality. The presented algorithm is an improved version of the first known non-trivial algorithm for checking normality developed by Daum, Dobbertin and Leander. The time complexity of our modification is greatly reduced comparing to original algorithm.
Ako citovať:
ISO 690:
Nowak, K. 2006. Checking normality of Boolean functions. In Tatra Mountains Mathematical Publications, vol. 33, no.1, pp. 99-112. 1210-3195.

APA:
Nowak, K. (2006). Checking normality of Boolean functions. Tatra Mountains Mathematical Publications, 33(1), 99-112. 1210-3195.