scientific article
From MaRDI portal
Publication:3997944
zbMath0712.68003MaRDI QIDQ3997944
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (19)
Breaking DES using P systems. ⋮ On a conjecture about slender context-free languages ⋮ Conducting secret ballot elections in computer networks: Problems and solutions ⋮ Pitfalls in public key cryptosystems based on free partially commutative monoids and groups ⋮ Caractérisation results about $L$ codes ⋮ Cryptographic protocols for auctions and bargaining ⋮ A general construction for monoid-based knapsack protocols ⋮ Bounded delay L codes ⋮ Protocol completion incentive problems in cryptographic Vickrey auctions ⋮ Break Finite Automata Public Key Cryptosystem ⋮ A method for distorting the frequency of character occurrence in the simple substitution cipher ⋮ Language-theoretic problems arising from Richelieu cryptosystems ⋮ An RSA based public-key cryptosystem for secure communication ⋮ To the distortion of the frequency of occurrence of characters in a simple substitution code ⋮ A fair and efficient solution to the socialist millionaires' problem ⋮ Input-trees of finite automata and application to cryptanalysis ⋮ The multi-dimension RSA and its low exponent security ⋮ Was ist zero-knowledge? ⋮ A class of coders based on gsm
This page was built for publication:
