| 1992 | Differential Cryptanalysis Mod 2^32 with Applications to MD5. | Thomas A. Berson |
| 1992 | Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications. | Michael J. Beller, Yacov Yacobi |
| 1992 | Cryptographic Protocols Provably Secure Against Dynamic Adversaries. | Donald Beaver, Stuart Haber |
| 1992 | How to Break a "Secure" Oblivious Transfer Protocol. | Donald Beaver |
| 1992 | FFT Hashing is not Collision-free. | Thierry Baritaud, Henri Gilbert, Marc Girault |
| 1992 | Uniform Results in Polynomial-Time Security. | Paul Barbaroux |
| 1992 | On the Development of a Fast Elliptic Curve Cryptosystem. | Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone |
| 1991 | Hash Functions And Graphs With Large Girths. | Gilles Zmor |
| 1991 | On the Complexity of Hyperelliptic Discrete Logarithm Problem. | Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai |
| 1991 | Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. | Claus-Peter Schnorr |
| 1991 | A Construction for One Way Hash Functions and Pseudorandom Bit Generators. | Babak Sadeghiyan, Josef Pieprzyk |
| 1991 | A Formal Approach to Security Architectures. | Rainer A. Rueppel |
| 1991 | On the Security of the Schnorr Scheme using Preprocessing. | Peter de Rooij |
| 1991 | Boolean Functions Satisfying Higher Order Propagation Criteria. | Bart Preneel, Ren Govaerts, Joos Vandewalle |
| 1991 | Race Integrity Primitives Evaluation (RIPE): A Status Report. | Bart Preneel, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen |
| 1991 | On the Use of Interconnection Networks in Cryptography. | Michael Portz |
| 1991 | Randomized Authentication Systems. | Josef Pieprzyk, Reihaneh Safavi-Naini |
| 1991 | Probabilistic Analysis of Elementary Randimizers. | Josef Pieprzyk |
| 1991 | A Threshold Cryptosystem without a Trusted Party (Extended Abstract). | Torben P. Pedersen |
| 1991 | Distributed Provers with Applications to Undeniable Signatures. | Torben P. Pedersen |
| 1991 | Direct Zero Knowledge Proofs of Computational Power in Five Rounds. | Tatsuaki Okamoto, David Chaum, Kazuo Ohta |
| 1991 | Enumerating Nondegenerate Permutations. | Luke O'Connor |
| 1991 | Perfect Nonlinear S-Boxes. | Kaisa Nyberg |
| 1991 | Liv-Lempel Complexity for Periodic Sequences and its Cryptographic Application. | Sibylle Mund |
| 1991 | Dickson Pseudoprimes and Primality Testing. | Winfried B. Mller, Alan Oswald |