Front matter
3-9
A Prototype Encryption System Using Public Key
S C Serpell, C B Brookson and B L Clark
10-18
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
Taher ElGamal
19-36
A Public-Key Cryptosystem Based on the Word Problem
Neal R. Wagner and Marianne R. Magyarik
37-46
Efficient Signature Schemes Based on Polynomial Equations (preliminary version)
H. Ong, C. P. Schnorr and A. Shamir
47-53
Identity-Based Cryptosystems and Signature Schemes
Adi Shamir
54-65
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
Benny Chor and Ronald L. Rivest
66-70
Some Public-Key Crypto-Functions as Intractable as Factorization
H. C. Williams
73-82
Computing Logarithms in GF (2n)
I. F. Blake, R. C. Mullin and S. A. Vanstone
83-94
Wyner’s Analog Encryption Scheme: Results of a Simulation
Burt S. Kaliski
95-100
On Rotation Group and Encryption of Analog Signals
Su-shing Chen
101-113
The History of Book Ciphers
Albert C. Leighton and Stephen M. Matyas
114
An Update on Factorization at Sandia National Laboratories
J. A. Davis and D. B. Holdridge
115-143
An LSI Digital Encryption Processor (DEP)
R. C. Fairfield, A. Matusevich and J. Plany
144-146
Efficient hardware and software implementations for the DES
Marc Davio, Yvo Desmedt, Jo Goubert, Frank Hoornaert and Jean-Jacques Quisquater
147-173
Efficient hardware implementation of the DES
Frank Hoornaert, Jo Goubert and Yvo Desmedt
174-190
A Self-Synchronizing Cascaded Cipher System with Dynamic Control of Error Propagation
Norman Proctor
193-202
Efficient and Secure Pseudo-Random Number Generation (Extended Abstract)
Umesh V. Vazirani and Vijay V. Vazirani
203-230
An LSI Random Number Generator (RNG)
R. C. Fairfield, R. L. Mortenson and K. B. Coulthart
231-241
Generalized Linear Threshold Scheme
S. C. Kothari
242-268
Security of Ramp Schemes
G. R. Blakley and Catherine Meadows
269-275
A Fast Pseudo Random Permutation Generator With Applications to Cryptology
Selim G. Akl and Henk Meijer
276-288
On the Cryptographic Applications of Random Functions (Extended Abstract)
Oded Goldreich, Shafi Goldwasser and Silvio Micali
289-299
An
Efficient
Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
Manuel Blum and Shafi Goldwasser
303-313
RSA/Rabin least significant bits are
\tfrac12 + \tfrac1poly ( logN )
\tfrac{1}
{2} + \tfrac{1}
{{poly \left( {\log N} \right)}}
secure (Extended Abstract)
Benny Chor and Oded Goldreich
314-338
Information Theory without the Finiteness Assumption, I: Cryptosystems as Group-Theoretic Objects
G. R. Blakley
339-341
Cryptanalysis of Adfgvx Encipherment Systems
Alan G. Konheim
342-358
Breaking Iterated Knapsacks
Ernest F. Brickell
359-376
Dependence of output on input in DES: Small avalanche characteristics
Yvo Desmedt, Jean-Jacques Quisquater and Marc Davio
377-389
Des has no Per Round Linear Factors
J. A. Reeds and J. L. Manferdelli
393-400
A Message Authenticator Algorithm Suitable for a Mainframe Computer
Donald Watts Davies
401-410
Key Management for Secure Electronic Funds Transfer in a Retail Environment
Henry Beker and Michael Walker
411-431
Authentication Theory/Coding Theory
Gustavus J. Simmons
432-433
New Secret Codes Can Prevent a Computerized Big Brother
David Chaum
434-438
Fair Exchange of Secrets (extended abstract)
Tom Tedrick
439-453
Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and The Multi-Player Mental Poker Game (extended abstract)
Mordechai Yung
454-464
Poker Protocols
Steven Fortune and Michael Merritt
467
A “Paradoxical” Solution to The Signature Problem
Shafi Goldwasser, Silvio Micali and Ronald L. Rivest
468-474
Sequence Complexity as a Test for Cryptographic Systems
A. K. Leung and S. E. Tavares
475-480
An Update on Quantum Cryptography
Charles H. Bennett and Gilles Brassard
481-485
How to Keep a Secret Alive
Extensible Partial Key, Key Safeguarding, and Threshold Systems
David Chaum
Back matter