scientific article
From MaRDI portal
Publication:3705340
zbMath0581.94001MaRDI QIDQ3705340
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityNP-completedata securitycryptosystemsData Encryption Standarddata processing applicationstraditional cryptographic systems
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (14)
An analysis of a class of algorithms for \(S\)-box construction ⋮ A note on quantum related-key attacks ⋮ Applying fast simulation to find the number of good permutations ⋮ Nondegenerate functions and permutations ⋮ Group theoretic properties of Rijndael-like ciphers ⋮ Estimating the number of good permutations by a modified fast simulation method ⋮ On the concealability of messages by the Williams public-key encryption scheme ⋮ Randomness measures related to subset occurrence ⋮ Easy weighted majority games ⋮ A Layered Broadcast Cryptographic System ⋮ Analytical Characteristics of the DES ⋮ On the Security of Compressed Encodings ⋮ Some Results on the Information Theoretic Analysis of Cryptosystems ⋮ Über die minimale Fixpunktanzahl von Dickson-Permutationen auf Galoisfeldern. (On the minimum number of fixed points of Dickson permutations over Galois fields)
This page was built for publication:
