Rotation Symmetric Boolean Functions –; Count and Cryptographic Properties
✍ Scribed by Pantelimon Stǎnicǎ; Subhamoy Maitra
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 413 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper investigates the connections between three properties of a binary function. These properties are important in cryptography and are the Strict Avalanche Criterion, balance, and correlation immunity. We derive necessary and sufficient conditions for a function to possess various combination
In this paper, we study the construction of Rotation Symmetric Boolean Functions (RSBFs) which achieve a maximum algebraic immunity (AI). For the first time, a construction of balanced 2p-variable (p is an odd prime) RSBFs with maximum AI was provided, and the nonlinearity of the constructed RSBFs i
Suppose that G llowing corkditions: e denote &a, x) = g(b, x). (hb) b 4 G&s) = {O,l}cAcB k=2 IAl=& and F,,(g) be the set of all n variables Generalized oolean Functions e For Q oolean algebra I=m=2', we/me ~C(B)l = x3 ("; 2)(k + 2)f(m-2). k=O en nit is su#icienlly large, we have
The size of ordered binary decision diagrams OBDDs strongly depends on the chosen variable ordering. It is an obvious heuristic to use symmetric variable orderings, i.e., variable orderings where symmetric variables are arranged adjacently. In order to evaluate this heuristic, methods for estimating