scientific article; zbMATH DE number 975406

zbMATH Open0860.94024MaRDI QIDQ5284083FDOQ5284083

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

Publication date: 4 May 1997

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4132085
• Sequence complexity as a test for cryptographic systems
• scientific article
• 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

zbMATH Keywords

complexity of pseudorandom sequencessymmetric cryptographic system

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (9)

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

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)