Advances in Cryptology - ASIACRYPT'99

1. Front Matter

   PDF

2. Invited Talk

   1. Modulus Search for Elliptic Curve Cryptosystems

      • Kenji Koyama, Yukio Tsuruoka, Noboru Kunihiro

      Pages 1-7

3. Asymmetric Key Cryptosystems

   1. On the Lai-Massey Scheme

      • Serge Vaudenay

      Pages 8-19

   2. On Cryptographically Secure Vectorial Boolean Functions

      • Takashi Satoh, Tetsu Iwata, Kaoru Kurosawa

      Pages 20-28

4. Analysis

   1. Equivalent Keys of HPC

      • Carl D’Halluin, Gert Bijnens, Bart Preneel, Vincent Rijmen

      Pages 29-42

   2. Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials

      • Haruki Seki, Toshinobu Kaneko

      Pages 43-51

   3. Cryptanalysis of Two Cryptosystems Based on Group Actions

      • Simon R. Blackburn, Steven Galbraith

      Pages 52-61

   4. Probabilistic Higher Order Differential Attack and Higher Order Bent Functions

      • Tetsu Iwata, Kaoru Kurosawa

      Pages 62-74

5. Elliptic Curve Cryptosystems

   1. Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field

      • Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jiang Zhang

      Pages 75-85

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

      • Junji Shikata, Yuliang Zheng, Joe Suzuki, Hideki Imai

      Pages 86-102

   3. Speeding up the Discrete Log Computation on Curves with Automorphisms

      • I. Duursma, P. Gaudry, F. Morain

      Pages 103-121

   4. ECC: Do We Need to Count?

      • Jean-Sébastien Coron, Helena Handschuh, David Naccache

      Pages 122-134

   5. Elliptic Scalar Multiplication Using Point Halving

      • Erik Woodward Knudsen

      Pages 135-149

6. Public Key Cryptosystems

   1. On the Design of RSA with Short Secret Exponent

      • Hung-Min Sun, Wu-Chuan Yang, Chi-Sung Laih

      Pages 150-164

   2. Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries

      • Pascal Paillier, David Pointcheval

      Pages 165-179

   3. Adaptively-Secure Optimal-Resilience Proactive RSA

      • Yair Frankel, Philip MacKenzie, Moti Yung

      Pages 180-194

7. Integers and Computation

   1. Factorization of RSA-140 Using the Number Field Sieve

      • Stefania Cavallar, Bruce Dodson, Arjen Lenstra, Paul Leyland, Walter Lioen, Peter L. Montgomery et al.

      Pages 195-207

   2. How to Prove That a Committed Number Is Prime

      • Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan

      Pages 208-218

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

      • Detlef Hühnlein, Tsuyoshi Takagi

      Pages 219-231

   4. General Adversaries in Unconditional Multi-party Computation

      • Matthias Fitzi, Martin Hirt, Ueli Maurer

      Pages 232-246

Asiacrypt’99 was held in Singapore on 14-18 November 1999. Asiacrypt is one of the major events in the cryptology research community. Asiacrypt’99, the ?fth annual Asiacrypt conference, was sponsored by the Asiacrypt Steering Comm- tee and the Centre for Systems Security of the National University of Singapore, and in cooperation with the International Association for Cryptology Research. As the Program Co-Chairs of Asiacrypt’99, we are extremely honored to or- nize this event, which showcases the state-of-the-art development of cryptology research at the conclusion of this millennium. This year, a total of 96 research papers were submitted to Asiacrypt’99. The portfolio of country of origin of submissions serves as a good indicator of the - ternational reputation of the conference. Countries from which submissions or- inated include: Australia, Belgium, China, Estonia, France, Germany, Greece, India, Iran, Japan, Korea, Norway, Russia, Saudi Arabia, Switzerland, Sin- pore, Spain, Taiwan, Thailand, The Netherlands, Turkey, Ukraine, UK, USA and Yugoslavia. Through a stringent refereeing process by the Program C- mittee, 31 papers of outstanding quality were accepted and are included in the conference proceedings. Accepted papers were authored by researchers from the following countries: Australia, Belgium, France, Germany, India, Japan, China, Singapore, Switzerland, Taiwan, The Netherlands, UK, and USA.

• Boolean function
• Cryptology
• DES
• Signatur
• algorithms
• complexity
• cryptanalysis
• data encryption
• data security
• information protection
• information security
• networks
• privacy
• security
• algorithm analysis and problem complexity

• School of Software, Tsinghua University, Beijing, PR China

  Kwok-Yan Lam

• Graduate School of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan

  Eiji Okamoto

• Nanyang Technological University, Singapore

  Chaoping Xing

Policies and ethics