Kwok-Yan Lam, Eiji Okamoto, Chaoping Xing (Eds.):
Advances in Cryptology - ASIACRYPT '99, International Conference on the Theory and Applications of Cryptology and Information Security, Singapore, November 14-18, 1999, Proceedings.
Lecture Notes in Computer Science 1716 Springer 1999, ISBN 3-540-66666-4
Invited Talk
Asymmetric Key Cryptosystems
Analysis
Elliptic Curve Cryptosystems
- Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jiang Zhang:
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field.
75-85

- Junji Shikata, Yuliang Zheng, Joe Suzuki, Hideki Imai:
Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves.
86-102

- Iwan M. Duursma, Pierrick Gaudry, François Morain:
Speeding up the Discrete Log Computation on Curves with Automorphisms.
103-121

- Jean-Sébastien Coron, Helena Handschuh, David Naccache:
ECC: Do We Need to Count?
122-134

- Erik Woodward Knudsen:
Elliptic Scalar Multiplication Using Point Halving.
135-149

Public Key Cryptosystems
Integers and Computation
- Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Paul Zimmermann:
Factorization of RSA-140 Using the Number Field Sieve.
195-207

- Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan:
How to Prove That a Committed Number Is Prime.
208-218

- Detlef Hühnlein, Tsuyoshi Takagi:
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields.
219-231

- Matthias Fitzi, Martin Hirt, Ueli M. Maurer:
General Adversaries in Unconditional Multi-party Computation.
232-246

Network Security
Random Number
Key Management
Authentication
Last update Sat May 18 18:07:53 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page