| 2000 | Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography. | Mihir Bellare, Phillip Rogaway |
| 2000 | Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. | Mihir Bellare, Chanathip Namprempre |
| 2000 | The Security of Chaffing and Winnowing. | Mihir Bellare, Alexandra Boldyreva |
| 2000 | Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three. | Seigo Arita |
| 2000 | Power Analysis, What Is Now Possible.... | Mehdi-Laurent Akkar, Rgis Bevan, Paul Dischamp, Didier Moyart |
| 2000 | A New Forward-Secure Digital Signature Scheme. | Michel Abdalla, Leonid Reyzin |
| 2000 | Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques. | Michel Abdalla, Mihir Bellare |
| 1999 | A Class of Explicit Perfect Multi-sequences. | Chaoping Xing, Kwok-Yan Lam, Zhenghong Wei |
| 1999 | A | Yejing Wang, Reihaneh Safavi-Naini |
| 1999 | Linear Complexity versus Pseudorandomness: On Beth and Dai's Result. | Yongge Wang |
| 1999 | On the Lai-Massey Scheme. | Serge Vaudenay |
| 1999 | On the Design of RSA with Short Secret Exponent. | Hung-Min Sun, Wu-Chuan Yang, Chi-Sung Laih |
| 1999 | Optimizing the Menezes-Okamoto-Vanstone (MOV) Algorithm for Non-supersingular Elliptic Curves. | Junji Shikata, Yuliang Zheng, Joe Suzuki, Hideki Imai |
| 1999 | Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials. | Haruki Seki, Toshinobu Kaneko |
| 1999 | On Cryptographically Secure Vectorial Boolean Functions. | Takashi Satoh, Tetsu Iwata, Kaoru Kurosawa |
| 1999 | Broadcast Authentication in Group Communication. | Reihaneh Safavi-Naini, Huaxiong Wang |
| 1999 | Cryptanalysis of LFSR-Encrypted Codes with Unknown Combining Function. | Sarbani Palit, Bimal K. Roy |
| 1999 | Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries. | Pascal Paillier, David Pointcheval |
| 1999 | Periodical Multi-secret Threshold Cryptosystems. | Masayuki Numao |
| 1999 | How to Prove That a Committed Number Is Prime. | Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan |
| 1999 | Modulus Search for Elliptic Curve Cryptosystems. | Kenji Koyama, Yukio Tsuruoka, Noboru Kunihiro |
| 1999 | Elliptic Scalar Multiplication Using Point Halving. | Erik Woodward Knudsen |
| 1999 | Probabilistic Higher Order Differential Attack and Higher Order Bent Functions. | Tetsu Iwata, Kaoru Kurosawa |
| 1999 | Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields. | Detlef Hhnlein, Tsuyoshi Takagi |
| 1999 | Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field. | Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jiang Zhang |