Analysis and design of stream ciphers
Analysis and design of stream ciphers
Cryptography with cellular automata
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Pseudorandomness and Cryptographic Applications
Pseudorandomness and Cryptographic Applications
On the Quadratic Spans of Periodic Sequences
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference 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 Universal Statistical Test for Random Bit Generators
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Analysis of pseudo random sequences generated by cellular automata
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
Quality assessment for cryptographic algorithms is usually devised by a combination of statistical or information-theoretic techniques for testing a pseudo-random sequence generator (PRSG for short). Many tests among these share a common framework. The difference among tests usually relies on the choice of the computational device and its suitable definition of "size" that determines the workload needed to match the allegedly random output of a PRSG. The most outstanding examples among these are compared, showing that there appears to be a hierarchy of tests whose complexity increases with their discriminating power. The possibility of a tradeoff between computational complexity of the measure and its value in cryptographic strength assessment is explored, and the criteria towards an optimal measure of strength are proposed.