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 1998
Page
Title
1-10
Generating RSA Moduli with a Predetermined Portion
11-24
Generation of Shared RSA Keys by Two Parties
25-34
An Attack on RSA Given a Small Fraction of the Private Key Bits
35-49
C
*
-+
and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai
50
ECC/DLP and Fractoring-Based Cryptography: A Tale of Two Families (Abstract)
51-65
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
66-79
Efficient Implementation of Schoof's Algorithm
80-94
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F
2
n
95-109
Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings
110-125
Elliptic Curve Discrete Logarithms and the Index Calculus
126-132
Cryptanalysis of Rijmen-Preneel Trapdoor Ciphers
133-147
Improved Truncated Differential Attacks on SAFER
148-159
Optimal Resistance Against the Davies and Murphy Attack
160-174
A Group Signature Scheme with Improved Efficiency
175-186
A Study on the Proposed Korean Digital Signature Algorithm
187-199
Cryptoanalysis of the Original McEliece Cryptosystem
200-213
Improving the Security of the McEliece Public-Key Cryptosystem
214-226
Cryptoanalysis in Prime Order Subgroups of
Z
*
n
227-241
Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC
242-256
Bounds and Constructions for Multireceiver Authentication Codes
257-270
Fair Off-Line e-cash Made Easy
271-285
Off-Line Fair Payment Protocols Using Convertible Signatures
286-299
Efficient Fair Exchange with Verifiable Confirmation of Signatures
300-314
Adaptively Secure Oblivious Transfer
315-326
ML-Sequences over Rings
Z/(2
e
)
*
: I. Constructions of Nondegenerative ML-Sequences II. Injectiveness of Compression Mappings of New Classes
327-341
Analysis Methods for (Alleged) RC4
342-356
Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators
357-371
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
372-379
The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure
380-391
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically)
392-404
Audio and Optical Cryptography
405-419
Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement
420-433
Some Bounds and a Construction for Secure Broadcast Encryption