Advances in Cryptology - CRYPTO '89

1. Front Matter

   Pages I-XIII

   PDF

2. Opening session

   1. Keying the German Navy’s Enigma

      • David Kahn

      Pages 2-5

   2. Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context

      • Yvo G. Desmedt

      Pages 6-16

   3. On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs

      • Ivan Bjerre Damgård

      Pages 17-27

3. Why is cryptography harder than it looks?

   1. Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks

      • Russell L. Brand

      Pages 30-34

   2. The use of Encryption in Kerberos for Network Authentication

      • John T. Kohl

      Pages 35-43

   3. UNIX Password Security - Ten Years Later

      • David C. Feldmeier, Philip R. Karn

      Pages 44-63

   4. Practical Problems with a Cryptographic Protection Scheme

      • Jonathan M. Smith

      Pages 64-73

   5. The Smart Diskette A Universal User Token and Personal Crypto-Engine

      • Paul Barrett, Raymond Eisele

      Pages 74-79

4. Pseudo-randomness and Sequences

   1. On the Quadratic Spans of Periodic Sequences

      • Agnes Hui Chan, Richard A. Games

      Pages 82-89

   2. The Shortest Feedback Shift Register That Can Generate A Given Sequence

      • Cees J. A. Jansen, Dick E. Boekee

      Pages 90-99

   3. Perfect Local Randomness in Pseudo-random Sequences

      • Ueli M. Maurer, James L. Massey

      Pages 100-112

   4. Sparse Pseudorandom Distributions

      • Oded Goldreich, Hugo Krawczyk

      Pages 113-127

   5. Bit Commitment Using Pseudo-Randomness

      • Moni Naor

      Pages 128-136

5. Cryptanalysis and Implementation

   1. How to Predict Congruential Generators

      • Hugo Krawczyk

      Pages 138-153

   2. A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang

      • Bart Preneel, Antoon Bosselaers, René Govaerts, Joos Vandewalle

      Pages 154-163

   3. On the Linear Consistency Test (LCT) in Cryptanalysis with Applications

      • Kencheng Zeng, C. H. Yang, T. R. N. Rao

      Pages 164-174

   4. Batch RSA

      • Amos Fiat

      Pages 175-185

   5. On the Implementation of Elliptic Curve Cryptosystems

      • Andreas Bender, Guy Castagnoli

      Pages 186-192

6. Signature and Authentication I

   1. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs

      • Mihir Bellare, Shafi Goldwasser

      Pages 194-211

CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudo-randomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zero-knowledge and oblivious transfer, multiparty computation.

• access control
• authentication
• cryptoanalysis
• cryptography
• cryptology
• cryptosystems
• data security
• digital signature
• encryption
• hash function
• secret sharing

• Département IRO, Université de Montréal, Montréal, Canada

  Gilles Brassard

Policies and ethics