Front matter
3-13
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley and Gary L. Miller
14-17
Another Birthday Attack
Don Coppersmith
18-27
Attacks on Some RSA Signatures
Wiebren de Jonge and David Chaum
28-32
An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi
Ernest F. Brickell and John M. DeLaurentis
33-41
A Secure Subliminal Channel (?)
Gustavus J. Simmons
42-55
Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences
Yvo Desmedt
58-72
On the Security of Ping-Pong Protocols when Implemented using the RSA (Extended Abstract)
Shimon Even, Oded Goldreich and Adi Shamir
73-86
A Secure Poker Protocol that Minimizes the Effect of Player Coalitions
Claude Crépeau
87-103
A Framework for the Study of Cryptographic Protocols
Richard Berger, Sampath Kannan and René Peralta
104-107
Cheating at Mental Poker
Don Coppersmith
108-127
Security for the DoD Transmission Control Protocol
Whitfield Diffie
128-137
Symmetric Public-Key Encryption
Zvi Galil, Stuart Haber and Moti Yung
140-157
Software Protection: Myth or Reality?
James R. Gosler
158-179
Public Protection of Software
Amir Herzberg and Shlomit S. Pinter
180-189
Fingerprinting Long Forgiving Messages
G. R. Blakley, C. Meadows and G. B. Purdy
192-211
Cryptanalysis of des with a Reduced Number of Rounds
Sequences of Linear Factors in Block Ciphers
David Chaum and Jan-Hendrik Evertse
212-226
Is DES a Pure Cipher? (Results of More Cycling Experiments on DES) (Preliminary Abstract)
Burton S. Kaliski, Ronald L. Rivest and Alan T. Sherman
227-245
A Layered Approach to the Design of Private Key Cryptosystems
T. E. Moore and S. E. Tavares
246-259
Lifetimes of Keys in Cryptographic Key Management Systems
E. Okamoto and K. Nakamura
260-272
Correlation Immunity and the Summation Generator
Rainer A. Rueppel
273-279
Design of Combiners to Prevent Divide and Conquer Attacks
T. Siegenthaler
280-281
On the Security of DES
Adi Shamir
282-337
Information theory without the finiteness assumption, II. Unfolding the DES
G. R. Blakley
340-349
Analysis of a Public Key Approach Based on Polynomial Substitution
Harriet Fell and Whitfield Diffie
350-357
Developing an RSA Chip
Martin Kochanski
358-368
An M3 Public-Key Encryption Scheme
H. C. Williams
369-395
Trapdoor Rings And Their Use In Cryptography
V. Varadharajan
396-402
On Computing Logarithms Over Finite Fields
Taher ElGamal
403-408
N Using RSA with Low Exponent in a Public Key Network
Johan Hastad
409-416
Lenstra’s Factorisation Method Based on Elliptic Curves
N. M. Stephens
417-426
Use of Elliptic Curves in Cryptography
Victor S. Miller
429-432
Cryptography with Cellular Automata
Stephen Wolfram
433-446
Efficient Parallel Pseudo-Random Number Generation
J. H. Reif and J. D. Tygar
447
How to Construct Pseudo-random Permutations from Pseudo-random Functions
Michael Luby and Charles Rackoff
448-457
The Bit Security of Modular Squaring given Partial Factorization of the Modulos
Benny Chor, Oded Goldreich and Shafi Goldwasser
458-467
Some Cryptographic Aspects of Womcodes
Philippe Godlewski and Gerard D. Cohen
468-476
How to Reduce your Enemy’s Information (extended abstract)
Charles H. Bennett, Gilles Brassard and Jean-Marc Robert
477-488
Encrypting Problem Instances
Or..., Can You Take Advantage of Someone Without Having to Trust Him?
Joan Feigenbaum
489-513
Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis
Johan van Tilburg and Dick E. Boekee
516-522
A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes
Y. Desmedt and A. M. Odlyzko
523-534
On the Design of S-Boxes
A. F. Webster and S. E. Tavares
535-536
The Real Reason for Rivest’s Phenomenon
Don Coppersmith
537-542
The Importance of “Good” Key Scheduling Schemes (How to Make a Secure DES* Scheme with ≤ 48 Bit Keys?)
Jean-Jacques Quisquater, Yvo Desmedt and Marc Davio
543-544
Access Control at the Netherlands Postal and Telecommunications Services
Willem Haemers
Back matter