scientific article; zbMATH DE number 975406

MaRDI QIDQ5284083zbMATH OpenFDO

Authors Spyros S. Magliveras, Kok C. Tam, Nasir Memon

Publication date 4 May 1997

zbMATH Keywords

complexity of pseudorandom sequencessymmetric cryptographic system

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 4132085
• Sequence complexity as a test for cryptographic systems
• scientific article; zbMATH DE number 4191557
• Complexity Measures for Public-Key Cryptosystems
• Algebraic properties of cryptosystem PGM
• The Complexity of Public-Key Cryptography
• Complexity theoretic aspects of some cryptographic functions
• Confirmatory tests used in cipher systems evaluations
• Testing the speed of algorithms and programs implementing the basic operations of asymmetric cryptography

Cited in

(9)

• Algebraic properties of cryptosystem PGM
• Testing the speed of algorithms and programs implementing the basic operations of asymmetric cryptography
• The existence of minimal logarithmic signatures for some finite simple unitary groups
• Statistical test criteria for sensitivity indexes of image cryptosystems
• Sequence complexity as a test for cryptographic systems
• scientific article; zbMATH DE number 4132085 (Why is no real title available?)
• The existence of minimal logarithmic signatures for some finite simple groups
• The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups
• A note on the security of \(\text{MST} _{3}\)

This page was built for publication:

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