| 2007 | MFCS | Public Key Identification Based on the Equivalence of Quadratic Forms. | Rupert J. Hartung, Claus-Peter Schnorr |
| 2003 | STACS | Lattice Reduction by Random Sampling and Birthday Methods. | Claus-Peter Schnorr |
| 2001 | ICICS | Security of Blind Discrete Log Signatures against Interactive Attacks. | Claus-Peter Schnorr |
| 2001 | PKC | Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. | Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu |
| 2000 | ASIACRYPT | Security of Signed ElGamal Encryption. | Claus-Peter Schnorr, Markus Jakobsson |
| 1997 | EuroCrypt | Stronger Security Proofs for RSA and Rabin Bits. | Roger Fischlin, Claus-Peter Schnorr |
| 1996 | CRYPTO | Security of 2^t-Root Identification and Signatures. | Claus-Peter Schnorr |
| 1996 | IPCO | An Optimal, Stable Continued Fraction Algorithm. | Carsten Rssner, Claus-Peter Schnorr |
| 1995 | EuroCrypt | Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. | Claus-Peter Schnorr, Horst Helmut Hrner |
| 1994 | EuroCrypt | Black Box Cryptanalysis of Hash Networks Based on Multipermutations. | Claus-Peter Schnorr, Serge Vaudenay |
| 1993 | FSE | Parallel FFT-Hashing. | Claus-Peter Schnorr, Serge Vaudenay |
| 1992 | EuroCrypt | Local Randomness in Candidate One-Way Functions. | Harald Niederreiter, Claus-Peter Schnorr |
| 1992 | EuroCrypt | FFT-Hash II, Efficient Cryptographic Hashing. | Claus-Peter Schnorr |
| 1991 | EuroCrypt | An Improved Low-Denisty Subset Sum Algorithm. | Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr |
| 1991 | EuroCrypt | Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. | Claus-Peter Schnorr |
| 1991 | FCT | Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. | Claus-Peter Schnorr, M. Euchner |
| 1990 | EuroCrypt | Fast Signature Generation With a Fiat Shamir-Like Scheme. | H. Ong, Claus-Peter Schnorr |
| 1989 | CRYPTO | Efficient Identification and Signatures for Smart Cards. | Claus-Peter Schnorr |
| 1989 | EuroCrypt | Efficient Identification and Signatures for Smart Cards (Abstract). | Claus-Peter Schnorr |
| 1988 | CRYPTO | Efficient, Perfect Random Number Generators. | Silvio Micali, Claus-Peter Schnorr |
| 1988 | EuroCrypt | On the Construction of Random Number Generators and Random Function Generators. | Claus-Peter Schnorr |
| 1988 | STACS | Geometry of Numbers and Integer Programming (Summary). | Claus-Peter Schnorr |
| 1987 | FOCS | The Multiplicative Complexity of Quadratic Boolean Forms | Roland Mirwald, Claus-Peter Schnorr |
| 1987 | ICALP | Approximating Integer Lattices by Lattices with Cyclic Factor Groups. | Azaria Paz, Claus-Peter Schnorr |
| 1986 | ICALP | A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). | Claus-Peter Schnorr |
| 1986 | STOC | An Optimal Sorting Algorithm for Mesh Connected Computers | Claus-Peter Schnorr, Adi Shamir |
| 1986 | STACS | Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. | Johan Hstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr |
| 1984 | CRYPTO | Efficient Signature Schemes Based on Polynomial Equations. | H. Ong, Claus-Peter Schnorr, Adi Shamir |
| 1984 | EuroCrypt | RSA-Bits are 0.5 + epsilon Secure. | Claus-Peter Schnorr, Werner Alexi |
| 1984 | FOCS | RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure | Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr |
| 1984 | STOC | An Efficient Signature Scheme Based on Quadratic Equations | H. Ong, Claus-Peter Schnorr, Adi Shamir |
| 1983 | CRYPTO | Signatures through Approximate Representation by Quadratic Forms. | H. Ong, Claus-Peter Schnorr |
| 1982 | EuroCrypt | Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel. | Jrgen Sattler, Claus-Peter Schnorr |
| 1982 | EuroCrypt | Is the RSA Scheme Safe? | Claus-Peter Schnorr |
| 1982 | FOCS | An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs | Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber |
| 1981 | ICALP | Refined Analysis and Improvements on Some Factoring Algorithms. | Claus-Peter Schnorr |
| 1980 | STOC | Testing Polynomials which Are Easy to Compute (Extended Abstract) | Joos Heintz, Claus-Peter Schnorr |
| 1978 | ICALP | Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. | Claus-Peter Schnorr |
| 1977 | MFCS | Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. | Claus-Peter Schnorr |
| 1976 | ICALP | Optimal Algorithms for Self-Reducible Problems. | Claus-Peter Schnorr |
| 1974 | ICALP | On Maximal Merging of Information in Boolean Computations. | Claus-Peter Schnorr |
| 1973 | MFCS | Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. | Claus-Peter Schnorr |
| 1972 | ICALP | Does the Computational Speed-up Concern Programming? | Claus-Peter Schnorr |
| 1972 | STOC | The Process Complexity and Effective Random Tests | Claus-Peter Schnorr |