Book Volume 473 1991

Advances in Cryptology — EUROCRYPT ’90

Workshop on the Theory and Application of Cryptographic Techniques Aarhus, Denmark, May 21–24, 1990 Proceedings


ISBN: 978-3-540-53587-4 (Print) 978-3-540-46877-6 (Online)

Table of contents (48 chapters)

previous Page of 3
  1. Front Matter

    Pages I-IX

  2. Protocols

    1. Chapter

      Pages 1-10

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

    2. Chapter

      Pages 11-15

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

    3. Chapter

      Pages 16-30

      Provably Secure Key-Updating Schemes in Identity-Based Systems

    4. Chapter

      Pages 31-45

      Oblivious transfer protecting secrecy

    5. Chapter

      Pages 46-62

      Public-Randomness in Public-Key Cryptography

    6. Chapter

      Pages 63-71

      An Interactive Identification Scheme Based on Discrete Logarithms and Factoring

  3. Number-Theoretic Algorithms

    1. Chapter

      Pages 72-82

      Factoring with two large primes

    2. Chapter

      Pages 83-97

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

    3. Chapter

      Pages 98-109

      Implementation of a Key Exchange Protocol Using Real Quadratic Fields

    4. Chapter

      Pages 110-123

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

  4. Boolean Functions

    1. Chapter

      Pages 124-139

      Properties of binary functions

    2. Chapter

      Pages 140-150

      How to Construct Pseudorandom Permutations from Single Pseudorandom Functions

    3. Chapter

      Pages 151-160

      Constructions of bent functions and difference sets

    4. Chapter

      Pages 161-173

      Propagation Characteristics of Boolean Functions

  5. Binary Sequences

    1. Chapter

      Pages 174-188

      The Linear Complexity Profile and the Jump Complexity of Keystream Sequences

    2. Chapter

      Pages 189-195

      Lower Bounds for the Linear Complexity of Sequences over Residue Rings

    3. Chapter

      Pages 196-203

      On the Construction of Run Permuted Sequences

    4. Chapter

      Pages 204-213

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

    5. Chapter

      Pages 214-221

      Correlation Functions of Geometric Sequences

  6. Implementations

    1. Chapter

      Pages 222-229

      Exponentiating Faster with Addition Chains

previous Page of 3