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