Invited Talk |
Modulus Search for Elliptic Curve Cryptosystems / K. Koyama ; Y. Tsuruoka ; N. Kunihiro |
Asymmetric Key Cryptosystems |
On the Lai-Massey Scheme / S. Vaudenay |
On Cryptographically Secure Vectorial Boolean Functions / T. Satoh ; T. Iwata ; K. Kurosawa |
Analysis |
Equivalent Keys of HPC / C. D'Halluin ; G. Bijnens ; B. Preneel ; V. Rijmen |
Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials / H. Seki ; T. Kaneko |
Cryptanalysis of Two Cryptosystems Based on Group Actions / S. R. Blackburn ; S. D. Galbraith |
Probabilistic Higher Order Differential Attack and Higher Order Bent Functions |
Elliptic Curve Cryptosystems |
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field / Y. F. Han ; P.-C. Leong ; P.-C. Tan ; J. Zhang |
Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves / J. Shikata ; Y. Zheng ; J. Suzuki ; H. Imai |
Speeding up the Discrete Log Computation on Curves with Automorphisms / I. Duursma ; P. Gaudry ; F. Morain |
ECC: Do We Need to Count? / J.-S. Coron ; H. Handschuh ; D. Naccache |
Elliptic Scalar Multiplication Using Point Halving / E. W. Knudsen |
Public Key Cryptosystems |
On the Design of RSA with Short Secret Exponent / H.-M. Sun ; W.-C. Yang ; C.-S. Laih |
Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries / P. Paillier ; D. Pointcheval |
Adaptively-Secure Optimal-Resilience Proactive RSA / Y. Frankel ; P. MacKenzie ; M. Yung |
Integers and Computation |
Factorization of RSA-140 Using the Number Field Sieve / S. Cavallar ; B. Dodson ; A. Lenstra ; P. Leyland ; W. Lioen ; P. L. Montgomery ; B. Murphy ; H. te Riele ; P. Zimmermann |
How to Prove that a Committed Number Is Prime / T. V. Le ; K. Q. Nguyen ; V. Varadharajan |
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields / D. Huhnlein ; T. Takagi |
General Adversaries in Unconditional Multi-party Computation / M. Fitzi ; M. Hirt ; U. Maurer |
Network Security |
Approximation Hardness and Secure Communication in Broadcast Channels / Y. Desmedt ; Y. Wang |
Mix-Networks on Permutation Networks / M. Abe |
Secure Communication in an Unknown Network Using Certificates / M. Burmester |
Random Number |
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result |
A Class of Explicit Perfect Multi-sequences / C. P. Xing ; K. Y. Lam ; Z. H. Wei |
Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function / S. Palit ; B. K. Roy |
Key Management |
Doing More with Fewer Bits / A. E. Brouwer ; R. Pellikaan ; E. R. Verheul |
A Quick Group Key Distribution Scheme with "Entity Revocation" / J. Anzai ; N. Matsuzaki ; T. Matsumoto |
An Efficient Hierachical Identity-Based Key-Sharing Method Resistant Against Collusion-Attacks / G. Hanaoka ; T. Nishioka |
Periodical Multi-secret Threshold Cryptosystems / M. Numao |
Authentication |
A Signature Scheme with Message Recovery as Secure as Discrete Logarithm / T. Okamoto |
Broadcast Authentication in Group Communication / Y. J. Wang ; R. Safavi-Naini ; H. X. Wang |
Author Index |
Invited Talk |
Modulus Search for Elliptic Curve Cryptosystems / K. Koyama ; Y. Tsuruoka ; N. Kunihiro |
Asymmetric Key Cryptosystems |