Journal of Cryptology, Volume 11

Volume 11, Number 1, 1998

• Joe Kilian, Erez Petrank:
  An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions. 1-27
  
• Kouichi Sakurai, Hiroki Shizuya:
  A Structural Comparison of the Computational Difficulty of Breaking Discrete Log Cryptosystems. 29-43
  
• Eli Biham:
  Cryptanalysis of Multiple Modes of Operation. 45-58
  
• Lars R. Knudsen, Xuejia Lai, Bart Preneel:
  Attacks on Fast Double Block Length Hash Functions. 59-72
  

Volume 11, Number 2, 1998

• Jovan Dj. Golic:
  On Matroid Characterization of Ideal Secret Sharing Schemes. 75-86
  
• Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
  Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. 87-108
  
• Renate Scheidler:
  A Public-Key Cryptosystem Using Purely Cubic Fields. 109-124
  
• Claus-Peter Schnorr, Serge Vaudenay:
  The Black-Box Model for Cryptographic Primitives. 125-140
  
• R. Balasubramanian, Neal Koblitz:
  The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes - Okamoto - Vanstone Algorithm. 141-145
  

Volume 11, Number 3, 1998

• Jørgen Brandt, Ivan Damgård, Peter Landrock, Torben P. Pedersen:
  Zero-Knowledge Authentication Scheme with Secret Key Exchange. 147-159
  
• Antoine Joux, Jacques Stern:
  Lattice Reduction: A Toolbox for the Cryptanalyst. 161-185
  
• Cynthia Dwork, Moni Naor:
  An Efficient Existentially Unforgeable Signature Scheme and Its Applications. 187-208
  
• Ivan Damgård, Lars R. Knudsen:
  Two-Key Triple Encryption. 209-218
  

Volume 11, Number 4, 1998

• Volker Müller:
  Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two. 219-234
  
• Sean Murphy:
  An Analysis of SAFER. 235-251
  
• Hans Dobbertin:
  Cryptanalysis of MD4. 253-271
  
• Phillip Rogaway, Don Coppersmith:
  A Software-Optimized Encryption Algorithm. 273-287