Advances in Cryptology – EUROCRYPT ’92

1. Front Matter

   Pages i-x

   PDF

2. Secret Sharing

   1. Graph Decompositions and Secret Sharing Schemes

      • C. Blundo, A. De Santis, D. R. Stinson, U. Vaccaro

      Pages 1-24

   2. Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups

      • Yair Frankel, Yvo Desmedt

      Pages 25-34

3. Hash Functions

   1. F.F.T. Hashing is not Collision-free

      • T. Baritaud, H. Gilbert, M. Girault

      Pages 35-44

   2. FFT-Hash II, Efficient Cryptographic Hashing

      • C. P. Schnorr

      Pages 45-54

   3. Hash Functions Based on Block Ciphers

      • Xucjia Lai, James L. Massey

      Pages 55-70

   4. Differential Cryptanalysis Mod 232 with Applications to MD5

      • Thomas A. Berson

      Pages 71-80

4. Block Ciphers

   1. A New Method for Known Plaintext Attack of FEAL Cipher

      • Mitsuru Matsui, Atsuhiro Yamagishi

      Pages 81-91

   2. On the construction of highly nonlinear permutations

      • Kaisa Nyberg

      Pages 92-98

   3. The One-Round Functions of the DES Generate the Alternating Group

      • Ralph Wernsdorf

      Pages 99-112

5. Stream Ciphers

   1. Correlation Via Linear Sequential Circuit Approximation of Combiners with Memory

      • Jovan Dj. Golić

      Pages 113-123

   2. Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register Sequence

      • Miodrag J. Mihaljević, Jovan Dj. Golić

      Pages 124-137

   3. Suffix trees and string complexity

      • Luke O’Connor, Tim Snider

      Pages 138-152

6. Public Key I

   1. Attacks on Protocols for Server-Aided RSA Computation

      • Birgit Pfitzmann, Michael Waidner

      Pages 153-162

   2. Public-Key Cryptosystems with Very Small Key Lengths

      • Greg Harper, Alfred Menezes, Scott Vanstone

      Pages 163-173

   3. Resource Requirements for the Application of Addition Chains in Modulo Exponentiation

      • Jörg Sauerbrey, Andreas Dietel

      Pages 174-182

7. Factoring

   1. Massively parallel elliptic curve factoring

      • B. Dixon, A. K. Lenstra

      Pages 183-193

8. The Eurocrypt’92 Controversial Issue Trapdoor Primes and Moduli

   1. The Eurocrypt’92 Controversial Issue Trapdoor Primes and Moduli

      Pages 194-199

9. Public Key II

   1. Fast Exponentiation with Precomputation

      • Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David B. Wilson

      Pages 200-207

   2. Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications

      • Michael J. Beller, Yacov Yacobi

      Pages 208-220

A series of workshops devoted to modern cryptography began in Santa Barbara,California in 1981 and was followed in 1982 by a European counterpart in Burg Feuerstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 meeting in Santa Barbara the International Association for Cryptologic Research was launched and it now sponsors all the meetings of the series. This volume presents the proceedings of Eurocrypt '92, held in Hungary. The papers are organized into the following parts: Secret sharing, Hash functions, Block ciphers, Stream ciphers, Public key I, Factoring, Trapdoor primes and moduli (panel report), Public key II, Pseudo-random permutation generators, Complexity theory and cryptography I, Zero-knowledge, Digital knowledge and electronic cash, Complexity theory andcryptography II, Applications, and selected papers from the rump session. Following the tradition of the series, the authors produced full papers after the meeting, in some cases with revisions.

• Cryptanalysis
• Komplexitätstheorie
• Krypto-Analysis
• Permutation
• Pseudo-Zufall-Permutationen
• Public-Key-Cryptosystems
• Public-Key-Kryptosysteme
• Z
• complexity theory
• cryptoanalysis
• cryptography
• cryptology
• cryptosystems
• hash function
• secret sharing
• combinatorics

• R3 Security Engineering, Wetzikon, Switzerland

  Rainer A. Rueppel

Policies and ethics