Analysis and design of stream ciphers
Analysis and design of stream ciphers
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
Analysis and Synthesis of Logic Systems
Analysis and Synthesis of Logic Systems
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Shift Register Sequences
Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Balancedness in binary sequences with cryptographic applications
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Deterministic analysis of balancedness in symmetric cryptography
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A deterministic approach to balancedness and run quantification in pseudorandom pattern generators
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
| Hi-index | 0.89 |
A simple method of computing the number of 1 's in the binary sequences obtained from combination generators has been developed. The procedure, which is based exclusively on the particular form of the combining function, can be applied to standard generators proposed and published in the open literature. As a straight consequence of this method, simple rules to design generators producing balanced (quasi-balanced) sequences are also derived.