Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Sequence Complexity as a Test for Cryptographic Systems

From MaRDI portal
Publication:2974499
Jump to:navigation, search

DOI10.1007/3-540-39568-7_38zbMath1359.94611OpenAlexW1578863054MaRDI QIDQ2974499

Alexander Kai-Man Leung, Stafford E. Tavares

Publication date: 10 April 2017

Published in: Advances in Cryptology (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)


Related Items (1)

On the distribution function of the complexity of finite sequences







This page was built for publication: Sequence Complexity as a Test for Cryptographic Systems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2974499&oldid=15985621"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 20:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki