David Chaum (Ed.):
Advances in Cryptology, Proceedings of CRYPTO '83, Santa Barbara, California, USA, August 21-24, 1983.
Plenum Press, New York 1984
- J. C. Lagarias:
Knapsack Public Key Cryptosystems and Diophantine Approximation.
3-23

- Ernest F. Brickell:
Solving Low Density Knapsacks.
25-37

- Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko:
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems.
39-42

- Shimon Even, Oded Goldreich:
On the Power of Cascade Ciphers.
43-50

- Gustavus J. Simmons:
The Prisoners' Problem and the Subliminal Channel.
51-67

- Hugh C. Williams:
An Overview of Factoring.
71-80

- Carl Pomerance, Jeffrey W. Smith, Samuel S. Wagstaff Jr.:
New Ideas for Factoring Large Integers.
81-85

- Marvin C. Wunderlich:
Factoring Numbers on the Massively Parallel Computer.
87-102

- James A. Davis, Diane B. Holdridge:
Factorization Using the Quadratic Sieve Algorithm.
103-113

- H. Ong, Claus-Peter Schnorr:
Signatures through Approximate Representation by Quadratic Forms.
117-131

- Oded Goldreich:
A Simple Protocol for Signing Contracts.
133-136

- Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani:
Reducibility Among Protocols.
137-146

- Tom Tedrick:
How to Exchange Half a Bit.
147-151

- David Chaum:
Blind Signature System.
153

- M. E. Spencerr, S. E. Travares:
A Layered Broadcast Cryptographic System.
157-170

- Marc Davio, Yvo Desmedt, Marc Fosseprez, René Govaerts, Jan Hulsbosch, Patrik Neutjens, Philippe Piret, Jean-Jacques Quisquater, Joos Vandewalle, Pascal Wouters:
Analytical Characteristics of the DES.
171-202

- Robert S. Winternitz:
Producing a One-Way Hash Function from DES.
203-207

- Selim G. Akl:
On the Security of Compressed Encodings.
209-230

- Dorothy E. Denning:
Field Encryption and Authentication.
231-247

- James A. Reeds, N. J. A. Sloane:
Shift-Register Synthesis (Modula m).
249

- Joel E. Sachs, Shimshon Berkovits:
Probabilistic Analysis and Performance Modelling of the `Swedish' Algorithm and Modifications.
253-273

- Taher El Gamal:
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p²).
275-292

- Rudolf Lidl, Winfried B. Müller:
Permutation Polynomials in RSA-Cryptosystems.
293-301

- Helmut Jürgensen, D. E. Matthew:
Some Results on the Information Theoretic Analysis of Cryptosystems.
303-356

- Bahaa W. Fam:
Improving the Security of Exponential Key Exchange.
359-368

- Umesh V. Vazirani, Vijay V. Vazirani:
RSA Bits are 732+epsilon Secure.
369-375

- Donald W. Davies:
Use of the `Signature Token' to Create a Negotiable Document.
377-382

- Shimon Even, Oded Goldreich:
Electronic Wallet.
383-386

- David Chaum:
Design Concepts for Tamper Responding Systems.
387-392

Last update Sun May 19 21:56:09 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page