Abstract is missing.
- Knapsack Public Key Cryptosystems and Diophantine ApproximationJ. C. Lagarias. 3-23
- Solving Low Density KnapsacksErnest F. Brickell. 25-37
- Evaluation of the Adleman Attack on Multiply Iterated Knapsack CryptosystemsErnest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko. 39-42
- An Overview of FactoringHugh C. Williams. 71-80
- New Ideas for Factoring Large IntegersCarl Pomerance, Jeffrey W. Smith, Samuel S. Wagstaff Jr.. 81-85
- Factoring Numbers on the Massively Parallel ComputerMarvin C. Wunderlich. 87-102
- Factorization Using the Quadratic Sieve AlgorithmJames A. Davis, Diane B. Holdridge. 103-113
- Signatures through Approximate Representation by Quadratic FormsH. Ong, Claus-Peter Schnorr. 117-131
- A Simple Protocol for Signing ContractsOded Goldreich. 133-136
- Reducibility Among ProtocolsManuel Blum, Umesh V. Vazirani, Vijay V. Vazirani. 137-146
- How to Exchange Half a BitTom Tedrick. 147-151
- Blind Signature SystemDavid Chaum. 153
- Analytical Characteristics of the DESMarc Davio, Yvo Desmedt, Marc Fosseprez, René Govaerts, Jan Hulsbosch, Patrik Neutjens, Philippe Piret, Jean-Jacques Quisquater, Joos Vandewalle, Pascal Wouters. 171-202
- On the Security of Compressed EncodingsSelim G. Akl. 209-230
- Field Encryption and AuthenticationDorothy E. Denning. 231-247
- Shift-Register Synthesis (Modula m)James A. Reeds, N. J. A. Sloane. 249
- Probabilistic Analysis and Performance Modelling of the Swedish Algorithm and ModificationsJoel E. Sachs, Shimshon Berkovits. 253-273
- Permutation Polynomials in RSA-CryptosystemsRudolf Lidl, Winfried B. Müller. 293-301
- Some Results on the Information Theoretic Analysis of CryptosystemsHelmut Jürgensen, D. E. Matthew. 303-356
- Improving the Security of Exponential Key ExchangeBahaa W. Fam. 359-368
- RSA Bits are 732+epsilon SecureUmesh V. Vazirani, Vijay V. Vazirani. 369-375
- Use of the Signature Token to Create a Negotiable DocumentDonald W. Davies. 377-382
- Design Concepts for Tamper Responding SystemsDavid Chaum. 387-392