Abstract is missing.
- Modulus Search for Elliptic Curve CryptosystemsKenji Koyama, Yukio Tsuruoka, Noboru Kunihiro. 1-7
- On the Lai-Massey SchemeSerge Vaudenay. 8-19
- On Cryptographically Secure Vectorial Boolean FunctionsTakashi Satoh, Tetsu Iwata, Kaoru Kurosawa. 20-28
- Equivalent Keys of HPCCarl D Halluin, Gert Bijnens, Bart Preneel, Vincent Rijmen. 29-42
- Cryptanalysis of Five Rounds of CRYPTON Using Impossible DifferentialsHaruki Seki, Toshinobu Kaneko. 43-51
- Cryptanalysis of Two Cryptosystems Based on Group ActionsSimon R. Blackburn, Steven D. Galbraith. 52-61
- Probabilistic Higher Order Differential Attack and Higher Order Bent FunctionsTetsu Iwata, Kaoru Kurosawa. 62-74
- Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite FieldYongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jiang Zhang. 75-85
- Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic CurvesJunji Shikata, Yuliang Zheng, Joe Suzuki, Hideki Imai. 86-102
- Speeding up the Discrete Log Computation on Curves with AutomorphismsIwan M. Duursma, Pierrick Gaudry, François Morain. 103-121
- ECC: Do We Need to Count?Jean-Sébastien Coron, Helena Handschuh, David Naccache. 122-134
- Elliptic Scalar Multiplication Using Point HalvingErik Woodward Knudsen. 135-149
- On the Design of RSA with Short Secret ExponentHung-Min Sun, Wu-Chuan Yang, Chi-Sung Laih. 150-164
- Efficient Public-Key Cryptosystems Provably Secure Against Active AdversariesPascal Paillier, David Pointcheval. 165-179
- Adaptively-Secure Optimal-Resilience Proactive RSAYair Frankel, Philip D. MacKenzie, Moti Yung. 180-194
- Factorization of RSA-140 Using the Number Field SieveStefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman te Riele, Paul Zimmermann. 195-207
- How to Prove That a Committed Number Is PrimeTri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan. 208-218
- Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite FieldsDetlef Hühnlein, Tsuyoshi Takagi. 219-231
- General Adversaries in Unconditional Multi-party ComputationMatthias Fitzi, Martin Hirt, Ueli M. Maurer. 232-246
- Approximation Hardness and Secure Communication in Broadcast ChannelsYvo Desmedt, Yongge Wang. 247-257
- Mix-Networks on Permutation NetworksMasayuki Abe. 258-273
- Secure Communication in an Unknown Network Using CertificatesMike Burmester, Yvo Desmedt. 274-287
- Linear Complexity versus Pseudorandomness: On Beth and Dai s ResultYongge Wang. 288-298
- A Class of Explicit Perfect Multi-sequencesChaoping Xing, Kwok-Yan Lam, Zhenghong Wei. 299-305
- Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining FunctionSarbani Palit, Bimal K. Roy. 306-320
- Doing More with Fewer BitsAndries E. Brouwer, Ruud Pellikaan, Eric R. Verheul. 321-332
- A Quick Group Key Distribution Scheme with Entity Revocation Jun Anzai, Natsume Matsuzaki, Tsutomu Matsumoto. 333-347
- An Efficient Hierarchical Identity-Based Key-Sharing Method Resistant against Collusion-AttacksGoichiro Hanaoka, Tsuyoshi Nishioka, Yuliang Zheng, Hideki Imai. 348-362
- Periodical Multi-secret Threshold CryptosystemsMasayuki Numao. 363-377
- A Signature Scheme with Message Recovery as Secure as Discrete LogarithmMasayuki Abe, Tatsuaki Okamoto. 378-389
- A:::3:::-Codes under Collusion AttacksYejing Wang, Reihaneh Safavi-Naini. 390-398
- Broadcast Authentication in Group CommunicationReihaneh Safavi-Naini, Huaxiong Wang. 399-411