Analysis and design of stream ciphers
Analysis and design of stream ciphers
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Propagation characteristics of Boolean functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Shortest Feedback Shift Register That Can Generate A Given Sequence
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A highly nonlinear cellular FSM-combiner for stream ciphers
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
| Hi-index | 0.00 |
In the theory of symmetric cipher design, criteria for the choice of Boolean functions with good behavior have been thoroughly studied. The character of these criteria is mainly statistiscal. We survey the often conflicting propoerties which are generally acknowledged, which shows the almost universal neglect of complexity-theoretic techniques. Of these, we propose the most prominent complexity measure concerning Boolean functions, to wit, boolean circuit complexity (BCC), as a means to assess Boolean function behavior in the context of symmetric algorithm design. The connection between BCC of the non-linear elements of a design and the pseudorandom stream generated with their help is shown by scrutiny of linear complexity profiles.