Book Volume 1716 1999

Advances in Cryptology - ASIACRYPT’99

International Conference on the Theory and Application of Cryptology and Information Security, Singapore, November 14-18, 1999. Proceedings


ISBN: 978-3-540-66666-0 (Print) 978-3-540-48000-6 (Online)

Table of contents (32 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Talk

    1. Chapter

      Pages 1-7

      Modulus Search for Elliptic Curve Cryptosystems

  3. Asymmetric Key Cryptosystems

    1. Chapter

      Pages 8-19

      On the Lai-Massey Scheme

    2. Chapter

      Pages 20-28

      On Cryptographically Secure Vectorial Boolean Functions

  4. Analysis

    1. Chapter

      Pages 29-42

      Equivalent Keys of HPC

    2. Chapter

      Pages 43-51

      Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials

    3. Chapter

      Pages 52-61

      Cryptanalysis of Two Cryptosystems Based on Group Actions

    4. Chapter

      Pages 62-74

      Probabilistic Higher Order Differential Attack and Higher Order Bent Functions

  5. Elliptic Curve Cryptosystems

    1. Chapter

      Pages 75-85

      Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field

    2. Chapter

      Pages 86-102

      Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves

    3. Chapter

      Pages 103-121

      Speeding up the Discrete Log Computation on Curves with Automorphisms

    4. Chapter

      Pages 122-134

      ECC: Do We Need to Count?

    5. Chapter

      Pages 135-149

      Elliptic Scalar Multiplication Using Point Halving

  6. Public Key Cryptosystems

    1. Chapter

      Pages 150-164

      On the Design of RSA with Short Secret Exponent

    2. Chapter

      Pages 165-179

      Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries

    3. Chapter

      Pages 180-194

      Adaptively-Secure Optimal-Resilience Proactive RSA

  7. Integers and Computation

    1. Chapter

      Pages 195-207

      Factorization of RSA-140 Using the Number Field Sieve

    2. Chapter

      Pages 208-218

      How to Prove That a Committed Number Is Prime

    3. Chapter

      Pages 219-231

      Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields

    4. Chapter

      Pages 232-246

      General Adversaries in Unconditional Multi-party Computation

  8. Network Security

    1. Chapter

      Pages 247-257

      Approximation Hardness and Secure Communication in Broadcast Channels

previous Page of 2