default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaus-Peter Schnorr
Person information
- affiliation: Goethe University of Frankfurt, Germany
- award (1993): Gottfried Wilhelm Leibniz Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1974
[b3]Claus-Peter Schnorr:
Rekursive Funktionen und ihre Komplexität. Leitfäden der angewandten Mathematik und Mechanik 24, Teubner 1974, ISBN 978-3-519-02322-7, pp. 1-191- 1971
- [b2]Claus-Peter Schnorr:
Zufälligkeit und Wahrscheinlichkeit - Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. Lecture Notes in Mathematics 218, Springer 1971, ISBN 978-3-540-05566-2, pp. I-IV, 1-212 - 1967
- [b1]Claus-Peter Schnorr:
Darstellbarkeit von Sprachen durch freie assoziative Systeme. Saarland University, Saarbrücken, Germany, 1967, pp. 1-78
Journal Articles
- 2014
- [j50]Johan Håstad
, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr:
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. SIAM J. Comput. 43(1): 254 (2014) - 2008
- [j49]Rupert J. Hartung, Claus-Peter Schnorr:
Identification and signatures based on NP-hard problems of indefinite quadratic forms. J. Math. Cryptol. 2(4): 327-341 (2008) - 2006
- [j48]Claus-Peter Schnorr:
Fast LLL-type lattice reduction. Inf. Comput. 204(1): 1-25 (2006) - [j47]Claus-Peter Schnorr:
Enhancing the security of perfect blind DL-signatures. Inf. Sci. 176(10): 1305-1320 (2006) - 2001
- [j46]Claus-Peter Schnorr:
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys. Inf. Process. Lett. 79(2): 93-98 (2001) - 2000
- [j45]Roger Fischlin, Claus-Peter Schnorr:
Stronger Security Proofs for RSA and Rabin Bits. J. Cryptol. 13(2): 221-244 (2000) - 1998
- [j44]Claus-Peter Schnorr, Serge Vaudenay:
The Black-Box Model for Cryptographic Primitives. J. Cryptol. 11(2): 125-140 (1998) - 1996
- [j43]Michael Kaib, Claus-Peter Schnorr:
The Generalized Gauss Reduction Algorithm. J. Algorithms 21(3): 565-578 (1996) - 1994
- [j42]Claus-Peter Schnorr:
Block Reduced Lattice Bases and Successive Minima. Comb. Probab. Comput. 3: 507-522 (1994) - [j41]Claus-Peter Schnorr, M. Euchner:
Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Program. 66: 181-199 (1994) - 1993
- [j40]Harald Niederreiter, Claus-Peter Schnorr:
Local Randomness in Polynomial Random Number and Random Function Generators. SIAM J. Comput. 22(4): 684-694 (1993) - 1992
- [j39]Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern:
Improved Low-Density Subset Sum Algorithms. Comput. Complex. 2: 111-128 (1992) - [j38]Roland Mirwald, Claus-Peter Schnorr:
The Multiplicative Complexity of Quadratic Boolean Forms. Theor. Comput. Sci. 102(2): 307-328 (1992) - 1991
- [j37]Silvio Micali, Claus-Peter Schnorr:
Efficient, Perfect Polynomial Random Number Generators. J. Cryptol. 3(3): 157-172 (1991) - [j36]Claus-Peter Schnorr:
Efficient Signature Generation by Smart Cards. J. Cryptol. 4(3): 161-174 (1991) - 1990
- [j35]J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr:
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Comb. 10(4): 333-348 (1990) - 1989
- [j34]Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr:
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers. SIAM J. Comput. 18(5): 859-881 (1989) - 1988
- [j33]Claus-Peter Schnorr:
A More Efficient Algorithm for Lattice Basis Reduction. J. Algorithms 9(1): 47-62 (1988) - [j32]Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr:
RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Comput. 17(2): 194-209 (1988) - 1987
- [j31]Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber:
An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs. J. ACM 34(3): 513-531 (1987) - [j30]Claus-Peter Schnorr:
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theor. Comput. Sci. 53: 201-224 (1987) - [j29]John M. Pollard, Claus-Peter Schnorr:
An efficient solution of the congruence x2+ky2=mpmod{n}. IEEE Trans. Inf. Theory 33(5): 702-709 (1987) - 1986
- [j28]Claus-Peter Schnorr:
A Gödel Theorem on Network Complexity Lower Bounds. Math. Log. Q. 32(19-24): 377-384 (1986) - 1984
- [j27]Adi Shamir, Claus-Peter Schnorr:
Cryptanalysis of Certain Variants of Rabin's Signature Scheme. Inf. Process. Lett. 19(3): 113-115 (1984) - 1983
- [j26]Claus-Peter Schnorr, Jürgen Sattler:
Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel. Computing 30(2): 91-110 (1983) - 1982
- [j25]Claus-Peter Schnorr:
Refined Analysis and Improvements on Some Factoring Algorithms. J. Algorithms 3(2): 101-127 (1982) - 1981
- [j24]Claus-Peter Schnorr:
How Many Polynomials can be Approximated Faster Than They can be Evaluated? Inf. Process. Lett. 12(2): 76-78 (1981) - [j23]Claus-Peter Schnorr:
An Extension of Strassen's Degree Bound. SIAM J. Comput. 10(2): 371-382 (1981) - 1980
- [j22]Claus-Peter Schnorr, Jean-Paul Van de Wiele:
On the Additive Complexity of Polynomials. Theor. Comput. Sci. 10: 1-18 (1980) - [j21]Claus-Peter Schnorr:
A 3n-Lower Bound on the Network Complexity of Boolean Functions. Theor. Comput. Sci. 10: 83-92 (1980) - 1979
- [j20]Claus-Peter Schnorr:
Bottlenecks and Edge Connectivity in Unsymmetrical Networks. SIAM J. Comput. 8(2): 265-274 (1979) - 1978
- [j19]Claus-Peter Schnorr:
Satisfiability Is Quasilinear Complete in NQL. J. ACM 25(1): 136-145 (1978) - [j18]Claus-Peter Schnorr:
An Algorithm for Transitive Closure with Linear Expected Time. SIAM J. Comput. 7(2): 127-133 (1978) - [j17]Claus-Peter Schnorr:
Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials. Theor. Comput. Sci. 7: 251-261 (1978) - 1977
- [j16]Claus-Peter Schnorr, H. Klupp:
A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors. Inf. Process. Lett. 6(2): 35-37 (1977) - [j15]Claus-Peter Schnorr, P. Fuchs:
General Random Sequences and Learnable Sequences. J. Symb. Log. 42(3): 329-340 (1977) - 1976
- [j14]Claus-Peter Schnorr:
The Network Complexity and the Turing Machine Complexity of Finite Functions. Acta Informatica 7: 95-107 (1976) - [j13]Claus-Peter Schnorr:
The Combinational Complexity of Equivalence. Theor. Comput. Sci. 1(4): 289-295 (1976) - [j12]Claus-Peter Schnorr:
A Lower Bound on the Number of Additions in Monotone Computations. Theor. Comput. Sci. 2(3): 305-315 (1976) - 1975
- [j11]Claus-Peter Schnorr, G. Stumpf:
A characterization of complexity sequences. Math. Log. Q. 21(1): 47-56 (1975) - [j10]Claus-Peter Schnorr:
Optimal Enumerations and Optimal Gödel Numberings. Math. Syst. Theory 8(2): 182-191 (1975) - 1974
- [j9]Claus-Peter Schnorr:
Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. Computing 13(2): 155-171 (1974) - 1973
- [j8]Claus-Peter Schnorr:
Process Complexity and Effective Random Tests. J. Comput. Syst. Sci. 7(4): 376-388 (1973) - 1972
- [j7]Claus-Peter Schnorr, H. Stimm:
Endliche Automaten und Zufallsfolgen. Acta Informatica 1: 345-359 (1972) - 1971
- [j6]Claus-Peter Schnorr:
A Unified Approach to the Definition of Random Sequences. Math. Syst. Theory 5(3): 246-258 (1971) - 1969
- [j5]Claus-Peter Schnorr, Hermann K.-G. Walter:
Pullbackkonstruktionen bei Semi-Thuesystemen. J. Inf. Process. Cybern. 5(1): 27-36 (1969) - [j4]Claus-Peter Schnorr:
Transformational Classes of Grammars. Inf. Control. 14(3): 252-277 (1969) - [j3]Claus-Peter Schnorr:
Errata: "Transformational Classes of Grammars". Inf. Control. 15(2): 207 (1969) - 1968
- [j2]Claus-Peter Schnorr:
Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen. Computing 3(4): 311-317 (1968) - 1967
- [j1]Claus-Peter Schnorr:
Freie assoziative Systeme. J. Inf. Process. Cybern. 3(6): 319-340 (1967)
Conference and Workshop Papers
- 2013
- [c58]Claus-Peter Schnorr:
Factoring Integers by CVP Algorithms. Number Theory and Cryptography 2013: 73-93 - 2007
- [c57]Rupert J. Hartung, Claus-Peter Schnorr:
Public Key Identification Based on the Equivalence of Quadratic Forms. MFCS 2007: 333-345 - 2003
- [c56]Claus-Peter Schnorr:
Lattice Reduction by Random Sampling and Birthday Methods. STACS 2003: 145-156 - 2001
- [c55]Henrik Koy, Claus-Peter Schnorr:
Segment LLL-Reduction of Lattice Bases. CaLC 2001: 67-80 - [c54]Henrik Koy, Claus-Peter Schnorr:
Segment LLL-Reduction with Floating Point Orthogonalization. CaLC 2001: 81-96 - [c53]Claus-Peter Schnorr:
Security of Blind Discrete Log Signatures against Interactive Attacks. ICICS 2001: 1-12 - [c52]Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu:
Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems. Public Key Cryptography 2001: 153-164 - 2000
- [c51]Claus-Peter Schnorr, Markus Jakobsson:
Security of Signed ElGamal Encryption. ASIACRYPT 2000: 73-89 - 1999
- [c50]Markus Jakobsson, Claus-Peter Schnorr:
Efficient Oblivious Proofs of Correct Exponentiation. Communications and Multimedia Security 1999: 71-86 - 1998
- [c49]Claus-Peter Schnorr, C. R. Subramanian:
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). RANDOM 1998: 218-231 - 1997
- [c48]Roger Fischlin, Claus-Peter Schnorr:
Stronger Security Proofs for RSA and Rabin Bits. EUROCRYPT 1997: 267-279 - 1996
- [c47]Claus-Peter Schnorr:
Security of 2^t-Root Identification and Signatures. CRYPTO 1996: 143-156 - [c46]Carsten Rössner, Claus-Peter Schnorr:
An Optimal, Stable Continued Fraction Algorithm. IPCO 1996: 31-43 - 1995
- [c45]Claus-Peter Schnorr, Horst Helmut Hörner:
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. EUROCRYPT 1995: 1-12 - [c44]Carsten Rössner, Claus-Peter Schnorr:
Computation of Highly Regular Nearby Points. ISTCS 1995: 174-181 - 1994
- [c43]Claus-Peter Schnorr, Serge Vaudenay:
Black Box Cryptanalysis of Hash Networks Based on Multipermutations. EUROCRYPT 1994: 47-57 - 1993
- [c42]Claus-Peter Schnorr, Serge Vaudenay:
Parallel FFT-Hashing. FSE 1993: 149-156 - 1992
- [c41]Claus-Peter Schnorr:
FFT-Hash II, Efficient Cryptographic Hashing. EUROCRYPT 1992: 45-54 - [c40]Harald Niederreiter, Claus-Peter Schnorr:
Local Randomness in Candidate One-Way Functions. EUROCRYPT 1992: 408-419 - 1991
- [c39]Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr:
An Improved Low-Denisty Subset Sum Algorithm. EUROCRYPT 1991: 54-67 - [c38]Claus-Peter Schnorr:
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. EUROCRYPT 1991: 281-293 - [c37]Claus-Peter Schnorr, M. Euchner:
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. FCT 1991: 68-85 - 1990
- [c36]Claus-Peter Schnorr:
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation. Advances In Computational Complexity Theory 1990: 171-181 - [c35]H. Ong, Claus-Peter Schnorr:
Fast Signature Generation With a Fiat Shamir-Like Scheme. EUROCRYPT 1990: 432-440 - 1989
- [c34]Claus-Peter Schnorr:
Efficient Identification and Signatures for Smart Cards. CRYPTO 1989: 239-252 - [c33]Claus-Peter Schnorr:
Efficient Identification and Signatures for Smart Cards (Abstract). EUROCRYPT 1989: 688-689 - 1988
- [c32]Claus-Peter Schnorr:
The Multiplicative Complexity of Boolean Functions. AAECC 1988: 45-58 - [c31]Silvio Micali, Claus-Peter Schnorr:
Efficient, Perfect Random Number Generators. CRYPTO 1988: 173-198 - [c30]Claus-Peter Schnorr:
On the Construction of Random Number Generators and Random Function Generators. EUROCRYPT 1988: 225-232 - [c29]Claus-Peter Schnorr:
Geometry of Numbers and Integer Programming (Summary). STACS 1988: 1-7 - 1987
- [c28]Roland Mirwald, Claus-Peter Schnorr:
The Multiplicative Complexity of Quadratic Boolean Forms. FOCS 1987: 141-150 - [c27]Azaria Paz, Claus-Peter Schnorr:
Approximating Integer Lattices by Lattices with Cyclic Factor Groups. ICALP 1987: 386-393 - 1986
- [c26]Claus-Peter Schnorr:
A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). ICALP 1986: 359-369 - [c25]Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr:
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. STACS 1986: 105-118 - [c24]Claus-Peter Schnorr, Adi Shamir:
An Optimal Sorting Algorithm for Mesh Connected Computers. STOC 1986: 255-263 - 1984
- [c23]H. Ong, Claus-Peter Schnorr, Adi Shamir:
Efficient Signature Schemes Based on Polynomial Equations. CRYPTO 1984: 37-46 - [c22]Claus-Peter Schnorr, Werner Alexi:
RSA-Bits are 0.5 + epsilon Secure. EUROCRYPT 1984: 113-126 - [c21]Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr:
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure. FOCS 1984: 449-457 - [c20]H. Ong, Claus-Peter Schnorr, Adi Shamir:
An Efficient Signature Scheme Based on Quadratic Equations. STOC 1984: 208-216 - 1983
- [c19]H. Ong, Claus-Peter Schnorr:
Signatures through Approximate Representation by Quadratic Forms. CRYPTO 1983: 117-131 - [c18]Claus-Peter Schnorr:
Monte-Carlo factoring algorithm with finite storage. Theoretical Computer Science 1983: 19-33 - 1982
- [c17]Claus-Peter Schnorr:
Is the RSA Scheme Safe? EUROCRYPT 1982: 325-329 - [c16]Jürgen Sattler, Claus-Peter Schnorr:
Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel. EUROCRYPT 1982: 331-351 - [c15]Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber:
An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs. FOCS 1982: 118-125 - 1981
- [c14]Claus-Peter Schnorr:
Refined Analysis and Improvements on Some Factoring Algorithms. ICALP 1981: 1-15 - 1980
- [c13]Joos Heintz, Claus-Peter Schnorr:
Testing Polynomials which Are Easy to Compute (Extended Abstract). STOC 1980: 262-272 - 1979
- [c12]Claus-Peter Schnorr:
On the Additive Complexity of Polynomials and some New Lower Bounds. Theoretical Computer Science 1979: 286-297 - 1978
- [c11]Claus-Peter Schnorr:
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. ICALP 1978: 425-439 - 1977
- [c10]Claus-Peter Schnorr:
Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. MFCS 1977: 135-147 - [c9]Claus-Peter Schnorr:
An algorithm for stransitive closure with linear expected time. Theoretical Computer Science 1977: 329-338 - [c8]C. Reynvaan, Claus-Peter Schnorr:
Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen. Theoretical Computer Science 1977: 368-390 - 1976
- [c7]Claus-Peter Schnorr:
Optimal Algorithms for Self-Reducible Problems. ICALP 1976: 322-337 - 1975
- [c6]Claus-Peter Schnorr:
The network-complexity of equivalence and other applications of the network complexity. Automata Theory and Formal Languages 1975: 83-92 - 1974
- [c5]Claus-Peter Schnorr:
On Maximal Merging of Information in Boolean Computations. ICALP 1974: 294-300 - 1973
- [c4]Claus-Peter Schnorr:
Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations. MFCS 1973: 153-161 - 1972
- [c3]Claus-Peter Schnorr:
Does the Computational Speed-up Concern Programming? ICALP 1972: 585-591 - [c2]Claus-Peter Schnorr:
The Process Complexity and Effective Random Tests. STOC 1972: 168-176 - 1971
- [c1]Claus-Peter Schnorr:
Optimal Gödel Numberings. IFIP Congress (1) 1971: 56-58
Parts in Books or Collections
- 2010
- [p2]Claus-Peter Schnorr:
Progress on LLL and Lattice Reduction. The LLL Algorithm 2010: 145-178 - 1992
- [p1]Claus-Peter Schnorr:
Computation of the Boolean Matrix-Vector, AND/OR-Produkt in Average Time O(m + nlnn). Informatik 1992: 359-362
Informal and Other Publications
- 2021
- [i8]Claus-Peter Schnorr:
Fast Factoring Integers by SVP Algorithms, corrected. IACR Cryptol. ePrint Arch. 2021: 933 (2021) - 2012
- [i7]Claus-Peter Schnorr, Taras Shevchenko:
Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction. IACR Cryptol. ePrint Arch. 2012: 620 (2012) - 2011
- [i6]Claus-Peter Schnorr:
Accelerated Slide- and LLL-Reduction. Electron. Colloquium Comput. Complex. TR11 (2011) - 1998
- [i5]Claus-Peter Schnorr:
Security of Allmost ALL Discrete Log Bits. Electron. Colloquium Comput. Complex. TR98 (1998) - [i4]Claus-Peter Schnorr:
Almost All Discrete Log Bits Are Simultaneously Secure. IACR Cryptol. ePrint Arch. 1998: 20 (1998) - 1996
- [i3]Claus-Peter Schnorr:
Security of 2t-Root Identification and Signatures. Electron. Colloquium Comput. Complex. TR96 (1996) - [i2]Carsten Rössner, Claus-Peter Schnorr:
An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [i1]Claus-Peter Schnorr, Horst Helmut Hörner:
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. Electron. Colloquium Comput. Complex. TR95 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
