Freie assoziative Systeme. - Claus-Peter Schnorr (J. Inf. Process. Cybern., 1967)

Darstellbarkeit von Sprachen durch freie assoziative Systeme. - Claus-Peter Schnorr (1967)

Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen. - Claus-Peter Schnorr (Computing, 1968)

Pullbackkonstruktionen bei Semi-Thuesystemen. - Claus-Peter Schnorr; Hermann K.-G. Walter (J. Inf. Process. Cybern., 1969)

Transformational Classes of Grammars - Claus-Peter Schnorr (Inf. Control., 1969)

Errata: "Transformational Classes of Grammars" - Claus-Peter Schnorr (Inf. Control., 1969)

Zufälligkeit und Wahrscheinlichkeit - Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. - Claus-Peter Schnorr (Springer, 1971)

Optimal Gödel Numberings. - Claus-Peter Schnorr (IFIP Congress (1), 1971)

A Unified Approach to the Definition of Random Sequences. - Claus-Peter Schnorr (Math. Syst. Theory, 1971)

Does the Computational Speed-up Concern Programming? - Claus-Peter Schnorr (ICALP, 1972)

Endliche Automaten und Zufallsfolgen. - Claus-Peter Schnorr; H. Stimm (Acta Informatica, 1972)

Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. - Claus-Peter Schnorr (MFCS, 1973)

Process Complexity and Effective Random Tests. - Claus-Peter Schnorr (J. Comput. Syst. Sci., 1973)

Rekursive Funktionen und ihre Komplexität. - Claus-Peter Schnorr (Teubner, 1974)

On Maximal Merging of Information in Boolean Computations. - Claus-Peter Schnorr (ICALP, 1974)

Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. - Claus-Peter Schnorr (Computing, 1974)

The network-complexity of equivalence and other applications of the network complexity. - Claus-Peter Schnorr (Automata Theory and Formal Languages, 1975)

A characterization of complexity sequences. - Claus-Peter Schnorr; G. Stumpf (Math. Log. Q., 1975)

Optimal Enumerations and Optimal Gödel Numberings. - Claus-Peter Schnorr (Math. Syst. Theory, 1975)

Optimal Algorithms for Self-Reducible Problems. - Claus-Peter Schnorr (ICALP, 1976)

The Network Complexity and the Turing Machine Complexity of Finite Functions. - Claus-Peter Schnorr (Acta Informatica, 1976)

The Combinational Complexity of Equivalence. - Claus-Peter Schnorr (Theor. Comput. Sci., 1976)

A Lower Bound on the Number of Additions in Monotone Computations. - Claus-Peter Schnorr (Theor. Comput. Sci., 1976)

Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. - Claus-Peter Schnorr (MFCS, 1977)

Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen. - C. Reynvaan; Claus-Peter Schnorr (Theoretical Computer Science, 1977)

An algorithm for stransitive closure with linear expected time. - Claus-Peter Schnorr (Theoretical Computer Science, 1977)

A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors. - Claus-Peter Schnorr; H. Klupp (Inf. Process. Lett., 1977)

General Random Sequences and Learnable Sequences. - Claus-Peter Schnorr; P. Fuchs (J. Symb. Log., 1977)

Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. - Claus-Peter Schnorr (ICALP, 1978)

Satisfiability Is Quasilinear Complete in NQL. - Claus-Peter Schnorr (J. ACM, 1978)

An Algorithm for Transitive Closure with Linear Expected Time. - Claus-Peter Schnorr (SIAM J. Comput., 1978)

Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials. - Claus-Peter Schnorr (Theor. Comput. Sci., 1978)

On the Additive Complexity of Polynomials and some New Lower Bounds. - Claus-Peter Schnorr (Theoretical Computer Science, 1979)

Bottlenecks and Edge Connectivity in Unsymmetrical Networks. - Claus-Peter Schnorr (SIAM J. Comput., 1979)

Testing Polynomials which Are Easy to Compute (Extended Abstract) - Joos Heintz; Claus-Peter Schnorr (STOC, 1980)

A 3n-Lower Bound on the Network Complexity of Boolean Functions. - Claus-Peter Schnorr (Theor. Comput. Sci., 1980)

On the Additive Complexity of Polynomials. - Claus-Peter Schnorr; Jean-Paul Van de Wiele (Theor. Comput. Sci., 1980)

How Many Polynomials can be Approximated Faster Than They can be Evaluated? - Claus-Peter Schnorr (Inf. Process. Lett., 1981)

An Extension of Strassen's Degree Bound. - Claus-Peter Schnorr (SIAM J. Comput., 1981)

Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel. - Jürgen Sattler; Claus-Peter Schnorr (EUROCRYPT, 1982)

Is the RSA Scheme Safe? - Claus-Peter Schnorr (EUROCRYPT, 1982)

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 006 (FOCS, 1982)

Refined Analysis and Improvements on Some Factoring Algorithms. - Claus-Peter Schnorr (J. Algorithms, 1982)

Signatures through Approximate Representation by Quadratic Forms. - H. Ong; Claus-Peter Schnorr (CRYPTO, 1983)

Monte-Carlo factoring algorithm with finite storage. - Claus-Peter Schnorr (Theoretical Computer Science, 1983)

Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel. - Claus-Peter Schnorr; Jürgen Sattler (Computing, 1983)

Efficient Signature Schemes Based on Polynomial Equations. - H. Ong; Claus-Peter Schnorr; Adi Shamir (CRYPTO, 1984)

RSA-Bits are 0.5 + epsilon Secure. - Claus-Peter Schnorr; Werner Alexi (EUROCRYPT, 1984)

RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure - Werner Alexi; Benny Chor; Oded Goldreich 001; Claus-Peter Schnorr (FOCS, 1984)

An Efficient Signature Scheme Based on Quadratic Equations - H. Ong; Claus-Peter Schnorr; Adi Shamir (STOC, 1984)

Cryptanalysis of Certain Variants of Rabin's Signature Scheme. - Adi Shamir; Claus-Peter Schnorr (Inf. Process. Lett., 1984)

A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). - Claus-Peter Schnorr (ICALP, 1986)

An Optimal Sorting Algorithm for Mesh Connected Computers - Claus-Peter Schnorr; Adi Shamir (STOC, 1986)

A Gödel Theorem on Network Complexity Lower Bounds. - Claus-Peter Schnorr (Math. Log. Q., 1986)

Approximating Integer Lattices by Lattices with Cyclic Factor Groups. - Azaria Paz; Claus-Peter Schnorr (ICALP, 1987)

An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. - Zvi Galil; Christoph M. Hoffmann; Eugene M. Luks; Claus-Peter Schnorr; Andreas Weber 006 (J. ACM, 1987)

A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. - Claus-Peter Schnorr (Theor. Comput. Sci., 1987)

An efficient solution of the congruence x2+ky2=mpmod{n}. - John M. Pollard; Claus-Peter Schnorr (IEEE Trans. Inf. Theory, 1987)

The Multiplicative Complexity of Boolean Functions. - Claus-Peter Schnorr (AAECC, 1988)

Efficient, Perfect Random Number Generators. - Silvio Micali; Claus-Peter Schnorr (CRYPTO, 1988)

On the Construction of Random Number Generators and Random Function Generators. - Claus-Peter Schnorr (EUROCRYPT, 1988)

Geometry of Numbers and Integer Programming (Summary). - Claus-Peter Schnorr (STACS, 1988)

A More Efficient Algorithm for Lattice Basis Reduction. - Claus-Peter Schnorr (J. Algorithms, 1988)

RSA and Rabin Functions: Certain Parts are as Hard as the Whole. - Werner Alexi; Benny Chor; Oded Goldreich 001; Claus-Peter Schnorr (SIAM J. Comput., 1988)

Efficient Identification and Signatures for Smart Cards. - Claus-Peter Schnorr (CRYPTO, 1989)

Efficient Identification and Signatures for Smart Cards (Abstract). - Claus-Peter Schnorr (EUROCRYPT, 1989)

Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. - Johan Håstad; Bettina Just; J. C. Lagarias 001; Claus-Peter Schnorr (SIAM J. Comput., 1989)

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation. - Claus-Peter Schnorr (Advances In Computational Complexity Theory, 1990)

Fast Signature Generation With a Fiat Shamir-Like Scheme. - H. Ong; Claus-Peter Schnorr (EUROCRYPT, 1990)

Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. - J. C. Lagarias 001; Hendrik W. Lenstra Jr.; Claus-Peter Schnorr (Comb., 1990)

An Improved Low-Denisty Subset Sum Algorithm. - Matthijs J. Coster; Brian A. LaMacchia; Andrew M. Odlyzko; Claus-Peter Schnorr (EUROCRYPT, 1991)

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. - Claus-Peter Schnorr (EUROCRYPT, 1991)

Efficient, Perfect Polynomial Random Number Generators. - Silvio Micali; Claus-Peter Schnorr (J. Cryptol., 1991)

Efficient Signature Generation by Smart Cards. - Claus-Peter Schnorr (J. Cryptol., 1991)

Computation of the Boolean Matrix-Vector, AND/OR-Produkt in Average Time O(m + nlnn). - Claus-Peter Schnorr (Informatik, 1992)

Local Randomness in Candidate One-Way Functions. - Harald Niederreiter; Claus-Peter Schnorr (EUROCRYPT, 1992)

FFT-Hash II, Efficient Cryptographic Hashing. - Claus-Peter Schnorr (EUROCRYPT, 1992)

Improved Low-Density Subset Sum Algorithms. - Matthijs J. Coster; Antoine Joux; Brian A. LaMacchia; Andrew M. Odlyzko; Claus-Peter Schnorr; Jacques Stern (Comput. Complex., 1992)

The Multiplicative Complexity of Quadratic Boolean Forms. - Roland Mirwald; Claus-Peter Schnorr (Theor. Comput. Sci., 1992)

Parallel FFT-Hashing. - Claus-Peter Schnorr; Serge Vaudenay (FSE, 1993)

Local Randomness in Polynomial Random Number and Random Function Generators. - Harald Niederreiter; Claus-Peter Schnorr (SIAM J. Comput., 1993)

Black Box Cryptanalysis of Hash Networks Based on Multipermutations. - Claus-Peter Schnorr; Serge Vaudenay (EUROCRYPT, 1994)

Block Reduced Lattice Bases and Successive Minima. - Claus-Peter Schnorr (Comb. Probab. Comput., 1994)

Lattice basis reduction: Improved practical algorithms and solving subset sum problems. - Claus-Peter Schnorr; M. Euchner (Math. Program., 1994)

Computation of Highly Regular Nearby Points. - Carsten Rössner; Claus-Peter Schnorr (ISTCS, 1995)

Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction - Claus-Peter Schnorr; Horst Helmut Hörner (Electron. Colloquium Comput. Complex., 1995)

Security of 2^t-Root Identification and Signatures. - Claus-Peter Schnorr (CRYPTO, 1996)

An Optimal, Stable Continued Fraction Algorithm. - Carsten Rössner; Claus-Peter Schnorr (IPCO, 1996)

Security of 2t-Root Identification and Signatures - Claus-Peter Schnorr (Electron. Colloquium Comput. Complex., 1996)

An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension - Carsten Rössner; Claus-Peter Schnorr (Electron. Colloquium Comput. Complex., 1996)

The Generalized Gauss Reduction Algorithm. - Michael Kaib; Claus-Peter Schnorr (J. Algorithms, 1996)

Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). - Claus-Peter Schnorr; C. R. Subramanian 001 (RANDOM, 1998)

Security of Allmost ALL Discrete Log Bits - Claus-Peter Schnorr (Electron. Colloquium Comput. Complex., 1998)

Almost All Discrete Log Bits Are Simultaneously Secure. - Claus-Peter Schnorr (IACR Cryptol. ePrint Arch., 1998)

The Black-Box Model for Cryptographic Primitives. - Claus-Peter Schnorr; Serge Vaudenay (J. Cryptol., 1998)

Efficient Oblivious Proofs of Correct Exponentiation. - Markus Jakobsson; Claus-Peter Schnorr (Communications and Multimedia Security, 1999)

Security of Signed ElGamal Encryption. - Claus-Peter Schnorr; Markus Jakobsson (ASIACRYPT, 2000)

Stronger Security Proofs for RSA and Rabin Bits. - Roger Fischlin; Claus-Peter Schnorr (J. Cryptol., 2000)

Segment LLL-Reduction of Lattice Bases. - Henrik Koy; Claus-Peter Schnorr (CaLC, 2001)

Segment LLL-Reduction with Floating Point Orthogonalization. - Henrik Koy; Claus-Peter Schnorr (CaLC, 2001)

Security of Blind Discrete Log Signatures against Interactive Attacks. - Claus-Peter Schnorr (ICICS, 2001)

Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. - Feng Bao 001; Robert H. Deng; Willi Geiselmann; Claus-Peter Schnorr; Rainer Steinwandt; Hongjun Wu 001 (Public Key Cryptography, 2001)

Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys. - Claus-Peter Schnorr (Inf. Process. Lett., 2001)

Lattice Reduction by Random Sampling and Birthday Methods. - Claus-Peter Schnorr (STACS, 2003)

Fast LLL-type lattice reduction. - Claus-Peter Schnorr (Inf. Comput., 2006)

Enhancing the security of perfect blind DL-signatures. - Claus-Peter Schnorr (Inf. Sci., 2006)

Public Key Identification Based on the Equivalence of Quadratic Forms. - Rupert J. Hartung; Claus-Peter Schnorr (MFCS, 2007)

Identification and signatures based on NP-hard problems of indefinite quadratic forms. - Rupert J. Hartung; Claus-Peter Schnorr (J. Math. Cryptol., 2008)

Progress on LLL and Lattice Reduction. - Claus-Peter Schnorr (The LLL Algorithm, 2010)

Accelerated Slide- and LLL-Reduction. - Claus-Peter Schnorr (Electron. Colloquium Comput. Complex., 2011)

Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction. - Claus-Peter Schnorr; Taras Shevchenko (IACR Cryptol. ePrint Arch., 2012)

Factoring Integers by CVP Algorithms. - Claus-Peter Schnorr (Number Theory and Cryptography, 2013)

Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. - Johan Håstad; Bettina Just; J. C. Lagarias 001; Claus-Peter Schnorr (SIAM J. Comput., 2014)

Fast Factoring Integers by SVP Algorithms, corrected. - Claus-Peter Schnorr (IACR Cryptol. ePrint Arch., 2021)