Advances in Cryptology – EUROCRYPT '90

1. Front Matter

   Pages I-IX

   PDF

2. Protocols

   1. All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions

      • Mike V. D. Burmester, Yvo Desmedt

      Pages 1-10

   2. On the Importance of Memory Resources in the Security of Key Exchange Protocols

      • George Davida, Yvo Desmedt, René Peralta

      Pages 11-15

   3. Provably Secure Key-Updating Schemes in Identity-Based Systems

      • S. Shinozaki, T. Itoh, A. Fujioka, S. Tsujii

      Pages 16-30

   4. Oblivious transfer protecting secrecy

      • Bert den Boer

      Pages 31-45

   5. Public-Randomness in Public-Key Cryptography

      • Alfredo De Santis, Giuseppe Persiano

      Pages 46-62

   6. An Interactive Identification Scheme Based on Discrete Logarithms and Factoring

      • Ernest F. Brickell, Kevin S. McCurley

      Pages 63-71

3. Number-Theoretic Algorithms

   1. Factoring with two large primes

      • Arjen K. Lenstra, Mark S. Manasse

      Pages 72-82

   2. Which new RSA signatures can be computed from some given RSA signatures?

      • Jan-Hendrik Evertse, Eugène van Heyst

      Pages 83-97

   3. Implementation of a Key Exchange Protocol Using Real Quadratic Fields

      • Renate Scheidler, Johannes A. Buchmann, Hugh C. Williams

      Pages 98-109

   4. Distributed Primality Proving and the Primality of (23539 + 1)/3

      • François Morain

      Pages 110-123

4. Boolean Functions

   1. Properties of binary functions

      • Sheelagh Lloyd

      Pages 124-139

   2. How to Construct Pseudorandom Permutations from Single Pseudorandom Functions

      • Josef Pieprzyk

      Pages 140-150

   3. Constructions of bent functions and difference sets

      • Kaisa Nyberg

      Pages 151-160

   4. Propagation Characteristics of Boolean Functions

      • Bart Preneel, Werner Van Leekwijck, Luc Van Linden, René Govaerts, Joos Vandewalle

      Pages 161-173

5. Binary Sequences

   1. The Linear Complexity Profile and the Jump Complexity of Keystream Sequences

      • Harald Niederreiter

      Pages 174-188

   2. Lower Bounds for the Linear Complexity of Sequences over Residue Rings

      • Zong-duo Dai, Thomas Beth, Dieter Gollmann

      Pages 189-195

   3. On the Construction of Run Permuted Sequences

      • Cees J. A. Jansen

      Pages 196-203

   4. Correlation Properties of Combiners with Memory in Stream Ciphers (Extended Abstract)

      • Willi Meier, Othmar Staffelbach

      Pages 204-213

   5. Correlation Functions of Geometric Sequences

      • Agnes Hui Chan, Mark Goresky, Andrew Klapper

      Pages 214-221

Eurocrypt is a conference devoted to all aspects of cryptologic research, both theoretical and practical, sponsored by the International Association for Cryptologic Research (IACR). Eurocrypt 90 took place in Åarhus, Denmark, in May 1990. From the 85 papers submitted, 42 were selected for presentation at the conference and for inclusion in this volume. In addition to the formal contributions, short abstracts of a number of informal talks are included in these proceedings. The proceedings are organized into sessions on protocols, number-theoretic algorithms, boolean functions, binary sequences, implementations, combinatorial schemes, cryptanalysis, new cryptosystems, signatures and authentication, and impromptu talks.

• Cryptanalysis
• Cryptosystems
• Digital signatures
• Digitale Unterschrift
• Kryptanalysis
• Kryptographie
• Kryptosysteme
• Permutation
• Protocols
• Protokoll
• complexity
• cryptography
• cryptology
• sets
• combinatorics

• Matematisk Institut, Århus Universitet, Århus C, Denmark

  Ivan Bjerre Damgård

Policies and ethics