Sequence complexity as a test for cryptographic systems

DOI10.1007/3-540-39568-7_38MaRDI QIDQ2974499zbMATH OpenOpenAlexFDO

Authors Alexander Kai-Man Leung, Stafford E. Tavares

Publication date 10 April 2017

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-39568-7_38

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 975406
• Confirmatory tests used in cipher systems evaluations
• Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.
• scientific article; zbMATH DE number 2000415
• Linear Complexity and Random Sequences

Cited in

(10)

• On the distribution function of the complexity of finite sequences
• Statistical test criteria for sensitivity indexes of image cryptosystems
• Cryptology and complexity theories
• Confirmatory tests used in cipher systems evaluations
• Analysis of text complexity in a crypto system --- a case study on Telugu
• scientific article; zbMATH DE number 4059284 (Why is no real title available?)
• Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
• scientific article; zbMATH DE number 2000415 (Why is no real title available?)
• About the direct operational analysis of symmetric ciphers
• scientific article; zbMATH DE number 975406 (Why is no real title available?)

This page was built for publication: Sequence complexity as a test for cryptographic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2974499)