Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984)
From MaRDI portal
Publication:1059056
DOI10.1007/3-540-39568-7zbMATH Open0566.00035DBLPconf/crypto/1984OpenAlexW4229511327WikidataQ26883131 ScholiaQ26883131MaRDI QIDQ1059056
No author found.
Publication date: 1985
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://link.springer.com/978-3-540-15658-1
Proceedings of conferences of miscellaneous specific interest (00B25) Cryptography (94A60) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)
Related Items (72)
Equivocations for Homophonic Ciphers ⋮ On the Use of the Binary Multiplying Channel in a Private Communication System ⋮ Linear Ciphers and Random Sequence Generators with Multiple Clocks ⋮ RSA-bits are 0.5 + ε secure ⋮ Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme ⋮ Propagation Characteristics of the DES ⋮ Time-Division Multiplexing Scramblers: Selecting Permutations and Testing the System ⋮ Algebraical Structures of Cryptographic Transformations ⋮ Strong Primes are Easy to Find ⋮ On Cryptosystems Based on Polynomials and Finite Fields ⋮ Is the data encryption standard a group? (Results of cycling experiments on DES) ⋮ Some Public-Key Crypto-Functions as Intractable as Factorization ⋮ An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information ⋮ Non Linear Non Commutative Functions for Data Integrity ⋮ A New Trapdoor Knapsack Public Key Cryptosystem ⋮ RSA Chips (Past/Present/Future) (Extended abstract) ⋮ A Prototype Encryption System Using Public Key ⋮ A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms ⋮ Identity-Based Cryptosystems and Signature Schemes ⋮ The History of Book Ciphers ⋮ An LSI Digital Encryption Processor (DEP) ⋮ A Self-Synchronizing Cascaded Cipher System with Dynamic Control of Error Propagation ⋮ Security of Ramp Schemes ⋮ On the Cryptographic Applications of Random Functions (Extended Abstract) ⋮ RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract) ⋮ Cryptanalysis of Adfgvx Encipherment Systems ⋮ Dependence of output on input in DES: Small avalanche characteristics ⋮ Des has no Per Round Linear Factors ⋮ Fair Exchange of Secrets (extended abstract) ⋮ Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and The Multi-Player Mental Poker Game (extended abstract) ⋮ A “Paradoxical” Solution to The Signature Problem ⋮ Sequence Complexity as a Test for Cryptographic Systems ⋮ An Update on Quantum Cryptography ⋮ How to Keep a Secret Alive ⋮ Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989 ⋮ On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem ⋮ Cryptology and Complexity Theories ⋮ Advances in Cryptology ⋮ Wire-Tap Channel II ⋮ On the Security of Ping-Pong Protocols ⋮ Fast Computation of Discrete Logarithms in GF (q) ⋮ Security of a Keystream Cipher with Secret Initial Value ⋮ A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem ⋮ Knapsack Public Key Cryptosystems and Diophantine Approximation ⋮ Solving Low Density Knapsacks ⋮ Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems ⋮ On the Power of Cascade Ciphers ⋮ The Prisoners’ Problem and the Subliminal Channel ⋮ An Overview of Factoring ⋮ New Ideas for Factoring Large Integers ⋮ Factoring Numbers on the Massively Parallel Computer ⋮ Factorization Using the Quadratic Sieve Algorithm ⋮ Signatures Through Approximate Representations by Quadratic Forms ⋮ A Simple Protocol for Signing Contracts ⋮ Reducibility Among Protocols ⋮ How to Exchange Half a Bit ⋮ Blind Signature System ⋮ A Layered Broadcast Cryptographic System ⋮ Analytical Characteristics of the DES ⋮ Producing a One-Way Hash Function from DES ⋮ On the Security of Compressed Encodings ⋮ Field Encryption and Authentication ⋮ Probabilistic Analysis and Performance Modelling of the ‘Swedish’ Algorithm and Modifications ⋮ A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) ⋮ Permutation Polynomials in RSA-Cryptosystems ⋮ Some Results on the Information Theoretic Analysis of Cryptosystems ⋮ Improving the Security of Exponential Key Exchange ⋮ RSA bits are .732 + ε secure ⋮ Use of the ‘Signature Token’ to Create a Negotiable Document ⋮ A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) ⋮ Advances in cryptology -- CRYPTO '85. Proceedings. (A Conference on the Theory and Application of Cryptographic techniques held at the University of California, Santa Barbara, August 18--22, 1985) ⋮ Authentication Theory/Coding Theory
This page was built for publication: Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984)
