Article
Licensed
Unlicensed
Requires Authentication
The relationship between the level of affinity and cryptographic parameters of Boolean functions
-
M. L. Buryakov
Published/Copyright:
July 9, 2008
Abstract
We consider the relations between the level of affinity and other cryptographic parameters of Boolean functions such as nonlinearity, the order of correlation, and algebraic immunity. It is proved that the problem of finding the level of affinity for certain class of functions is an NP-hard problem.
Received: 2007-12-11
Published Online: 2008-07-09
Published in Print: 2008-June
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
Articles in the same Issue
- The relationship between the level of affinity and cryptographic parameters of Boolean functions
- Testing numbers of the form for primality
- On the complexity of construction of complete and complete bipartite graphs
- Minimality and deadlockness of multitape automata
- Limit distributions of the number of absent chains of identical outcomes
- Parallel embeddings of octahedral polyhedra
