Advances in Cryptology - ASIACRYPT’99: International Conference on the Theory and Application of Cryptology and Information Security, Singapore, November 14-18, 1999. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Kenji Koyama, Yukio Tsuruoka, Noboru Kunihiro (auth.), Kwok-Yan Lam, Eiji Okamoto, Chaoping Xing (eds.)
Series: Lecture Notes in Computer Science 1716
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1999

Language: English
Pages: 420
City: New York
Tags: Data Encryption; Operating Systems; Algorithm Analysis and Problem Complexity; Computer Communication Networks; Computational Mathematics and Numerical Analysis; Discrete Mathematics in Computer Science

Front Matter....Pages -
Modulus Search for Elliptic Curve Cryptosystems....Pages 1-7
On the Lai-Massey Scheme....Pages 8-19
On Cryptographically Secure Vectorial Boolean Functions....Pages 20-28
Equivalent Keys of HPC....Pages 29-42
Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials....Pages 43-51
Cryptanalysis of Two Cryptosystems Based on Group Actions....Pages 52-61
Probabilistic Higher Order Differential Attack and Higher Order Bent Functions....Pages 62-74
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field....Pages 75-85
Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves....Pages 86-102
Speeding up the Discrete Log Computation on Curves with Automorphisms....Pages 103-121
ECC: Do We Need to Count?....Pages 122-134
Elliptic Scalar Multiplication Using Point Halving....Pages 135-149
On the Design of RSA with Short Secret Exponent....Pages 150-164
Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries....Pages 165-179
Adaptively-Secure Optimal-Resilience Proactive RSA....Pages 180-194
Factorization of RSA-140 Using the Number Field Sieve....Pages 195-207
How to Prove That a Committed Number Is Prime....Pages 208-218
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields....Pages 219-231
General Adversaries in Unconditional Multi-party Computation....Pages 232-246
Approximation Hardness and Secure Communication in Broadcast Channels....Pages 247-257
Mix-Networks on Permutation Networks....Pages 258-273
Secure Communication in an Unknown Network Using Certificates....Pages 274-287
Linear Complexity versus Pseudorandomness: On Beth and Dai’s Result....Pages 288-298
A Class of Explicit Perfect Multi-sequences....Pages 299-305
Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function....Pages 306-320
Doing More with Fewer Bits....Pages 321-332
A Quick Group Key Distribution Scheme with “Entity Revocation”....Pages 333-347
An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-Attacks....Pages 348-362
Periodical Multi-secret Threshold Cryptosystems....Pages 363-377
A Signature Scheme with Message Recovery as Secure as Discrete Logarithm....Pages 378-389
A 3 -Codes under Collusion Attacks....Pages 390-398
Broadcast Authentication in Group Communication....Pages 399-412
Back Matter....Pages -