Claus-Peter Schnorr

Publication Activity (10 Years)

Years Active: 1967-2021
Publications (10 Years): 2

Top Venues

IACR Cryptol. ePrint Arch.

Number Theory and Cryptography

SIAM J. Comput.

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Claus-Peter Schnorr
Fast Factoring Integers by SVP Algorithms, corrected. IACR Cryptol. ePrint Arch. 2021 (2021)
Claus-Peter Schnorr
Fast Factoring Integers by SVP Algorithms. IACR Cryptol. ePrint Arch. 2021 (2021)
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) (2014)
Claus-Peter Schnorr
Factoring Integers by CVP Algorithms. Number Theory and Cryptography (2013)
Claus-Peter Schnorr, Taras Shevchenko
Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction. IACR Cryptol. ePrint Arch. 2012 (2012)
Claus-Peter Schnorr
Accelerated Slide- and LLL-Reduction. Electron. Colloquium Comput. Complex. 18 (2011)
Rupert J. Hartung, Claus-Peter Schnorr
Identification and signatures based on NP-hard problems of indefinite quadratic forms. J. Math. Cryptol. 2 (4) (2008)
Rupert J. Hartung, Claus-Peter Schnorr
Public Key Identification Based on the Equivalence of Quadratic Forms. MFCS (2007)
Claus-Peter Schnorr
Fast LLL-type lattice reduction. Inf. Comput. 204 (1) (2006)
Claus-Peter Schnorr
Enhancing the security of perfect blind DL-signatures. Inf. Sci. 176 (10) (2006)
Claus-Peter Schnorr
Lattice Reduction by Random Sampling and Birthday Methods. STACS (2003)
Henrik Koy, Claus-Peter Schnorr
Segment LLL-Reduction of Lattice Bases. CaLC (2001)
Claus-Peter Schnorr
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys. Inf. Process. Lett. 79 (2) (2001)
Claus-Peter Schnorr
Security of Blind Discrete Log Signatures against Interactive Attacks. ICICS (2001)
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)
Henrik Koy, Claus-Peter Schnorr
Segment LLL-Reduction with Floating Point Orthogonalization. CaLC (2001)
Claus-Peter Schnorr, Markus Jakobsson
Security of Signed ElGamal Encryption. ASIACRYPT (2000)
Roger Fischlin, Claus-Peter Schnorr
Stronger Security Proofs for RSA and Rabin Bits. J. Cryptol. 13 (2) (2000)
Markus Jakobsson, Claus-Peter Schnorr
Efficient Oblivious Proofs of Correct Exponentiation. Communications and Multimedia Security (1999)
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)
Claus-Peter Schnorr, Serge Vaudenay
The Black-Box Model for Cryptographic Primitives. J. Cryptol. 11 (2) (1998)
Claus-Peter Schnorr
Almost All Discrete Log Bits Are Simultaneously Secure. IACR Cryptol. ePrint Arch. 1998 (1998)
Claus-Peter Schnorr
Security of Allmost ALL Discrete Log Bits Electron. Colloquium Comput. Complex. 5 (33) (1998)
Roger Fischlin, Claus-Peter Schnorr
Stronger Security Proofs for RSA and Rabin Bits. EUROCRYPT (1997)
Michael Kaib, Claus-Peter Schnorr
The Generalized Gauss Reduction Algorithm. J. Algorithms 21 (3) (1996)
Carsten Rössner, Claus-Peter Schnorr
An Optimal, Stable Continued Fraction Algorithm. IPCO (1996)
Claus-Peter Schnorr
Security of 2^t-Root Identification and Signatures. CRYPTO (1996)
Carsten Rössner, Claus-Peter Schnorr
An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension Electron. Colloquium Comput. Complex. 3 (20) (1996)
Claus-Peter Schnorr
-Root Identification and Signatures Electron. Colloquium Comput. Complex. 3 (19) (1996)
Claus-Peter Schnorr, Horst Helmut Hörner
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction Electron. Colloquium Comput. Complex. 2 (26) (1995)
Carsten Rössner, Claus-Peter Schnorr
Computation of Highly Regular Nearby Points. ISTCS (1995)
Claus-Peter Schnorr, Horst Helmut Hörner
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction. EUROCRYPT (1995)
Claus-Peter Schnorr
Block Reduced Lattice Bases and Successive Minima. Comb. Probab. Comput. 3 (1994)
Claus-Peter Schnorr, Serge Vaudenay
Black Box Cryptanalysis of Hash Networks Based on Multipermutations. EUROCRYPT (1994)
Claus-Peter Schnorr, M. Euchner
Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Program. 66 (1994)
Claus-Peter Schnorr, Serge Vaudenay
Parallel FFT-Hashing. FSE (1993)
Harald Niederreiter, Claus-Peter Schnorr
Local Randomness in Polynomial Random Number and Random Function Generators. SIAM J. Comput. 22 (4) (1993)
Harald Niederreiter, Claus-Peter Schnorr
Local Randomness in Candidate One-Way Functions. EUROCRYPT (1992)
Claus-Peter Schnorr
FFT-Hash II, Efficient Cryptographic Hashing. EUROCRYPT (1992)
Roland Mirwald, Claus-Peter Schnorr
The Multiplicative Complexity of Quadratic Boolean Forms. Theor. Comput. Sci. 102 (2) (1992)
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 (1992)
Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr
An Improved Low-Denisty Subset Sum Algorithm. EUROCRYPT (1991)
Claus-Peter Schnorr
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations. EUROCRYPT (1991)
Claus-Peter Schnorr
Efficient Signature Generation by Smart Cards. J. Cryptol. 4 (3) (1991)
Claus-Peter Schnorr, M. Euchner
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. FCT (1991)
Silvio Micali, Claus-Peter Schnorr
Efficient, Perfect Polynomial Random Number Generators. J. Cryptol. 3 (3) (1991)
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) (1990)
Claus-Peter Schnorr
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation. Advances In Computational Complexity Theory (1990)
H. Ong, Claus-Peter Schnorr
Fast Signature Generation With a Fiat Shamir-Like Scheme. EUROCRYPT (1990)
Claus-Peter Schnorr
Efficient Identification and Signatures for Smart Cards. CRYPTO (1989)
Claus-Peter Schnorr
Efficient Identification and Signatures for Smart Cards (Abstract). EUROCRYPT (1989)
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) (1989)
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) (1988)
Claus-Peter Schnorr
On the Construction of Random Number Generators and Random Function Generators. EUROCRYPT (1988)
Claus-Peter Schnorr
Geometry of Numbers and Integer Programming (Summary). STACS (1988)
Silvio Micali, Claus-Peter Schnorr
Efficient, Perfect Random Number Generators. CRYPTO (1988)
Claus-Peter Schnorr
A More Efficient Algorithm for Lattice Basis Reduction. J. Algorithms 9 (1) (1988)
Claus-Peter Schnorr
The Multiplicative Complexity of Boolean Functions. AAECC (1988)
Roland Mirwald, Claus-Peter Schnorr
The Multiplicative Complexity of Quadratic Boolean Forms FOCS (1987)
Claus-Peter Schnorr
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theor. Comput. Sci. 53 (1987)
Azaria Paz, Claus-Peter Schnorr
Approximating Integer Lattices by Lattices with Cyclic Factor Groups. ICALP (1987)
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) (1987)
John M. Pollard, Claus-Peter Schnorr
=mpmod{n}. IEEE Trans. Inf. Theory 33 (5) (1987)
Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. STACS (1986)
Claus-Peter Schnorr
A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). ICALP (1986)
Claus-Peter Schnorr
A Gödel Theorem on Network Complexity Lower Bounds. Math. Log. Q. 32 (19-24) (1986)
Claus-Peter Schnorr, Adi Shamir
An Optimal Sorting Algorithm for Mesh Connected Computers STOC (1986)
Adi Shamir, Claus-Peter Schnorr
Cryptanalysis of Certain Variants of Rabin's Signature Scheme. Inf. Process. Lett. 19 (3) (1984)
H. Ong, Claus-Peter Schnorr, Adi Shamir
An Efficient Signature Scheme Based on Quadratic Equations STOC (1984)
H. Ong, Claus-Peter Schnorr, Adi Shamir
Efficient Signature Schemes Based on Polynomial Equations. CRYPTO (1984)
Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure FOCS (1984)
Claus-Peter Schnorr, Werner Alexi
RSA-Bits are 0.5 + epsilon Secure. EUROCRYPT (1984)
H. Ong, Claus-Peter Schnorr
Signatures through Approximate Representation by Quadratic Forms. CRYPTO (1983)
Claus-Peter Schnorr
Monte-Carlo factoring algorithm with finite storage. Theoretical Computer Science (1983)
Claus-Peter Schnorr, Jürgen Sattler
Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel. Computing 30 (2) (1983)
Claus-Peter Schnorr
Refined Analysis and Improvements on Some Factoring Algorithms. J. Algorithms 3 (2) (1982)
Claus-Peter Schnorr
Is the RSA Scheme Safe? EUROCRYPT (1982)
Jürgen Sattler, Claus-Peter Schnorr
Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel. EUROCRYPT (1982)
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)
Claus-Peter Schnorr
How Many Polynomials can be Approximated Faster Than They can be Evaluated? Inf. Process. Lett. 12 (2) (1981)
Claus-Peter Schnorr
Refined Analysis and Improvements on Some Factoring Algorithms. ICALP (1981)
Claus-Peter Schnorr
An Extension of Strassen's Degree Bound. SIAM J. Comput. 10 (2) (1981)
Joos Heintz, Claus-Peter Schnorr
Testing Polynomials which Are Easy to Compute (Extended Abstract) STOC (1980)
Claus-Peter Schnorr
A 3n-Lower Bound on the Network Complexity of Boolean Functions. Theor. Comput. Sci. 10 (1980)
Claus-Peter Schnorr, Jean-Paul Van de Wiele
On the Additive Complexity of Polynomials. Theor. Comput. Sci. 10 (1980)
Claus-Peter Schnorr
On the Additive Complexity of Polynomials and some New Lower Bounds. Theoretical Computer Science (1979)
Claus-Peter Schnorr
Bottlenecks and Edge Connectivity in Unsymmetrical Networks. SIAM J. Comput. 8 (2) (1979)
Claus-Peter Schnorr
An Algorithm for Transitive Closure with Linear Expected Time. SIAM J. Comput. 7 (2) (1978)
Claus-Peter Schnorr
Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials. Theor. Comput. Sci. 7 (1978)
Claus-Peter Schnorr
Satisfiability Is Quasilinear Complete in NQL. J. ACM 25 (1) (1978)
Claus-Peter Schnorr
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks. ICALP (1978)
Claus-Peter Schnorr, H. Klupp
A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors. Inf. Process. Lett. 6 (2) (1977)
C. Reynvaan, Claus-Peter Schnorr
Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen. Theoretical Computer Science (1977)
Claus-Peter Schnorr, P. Fuchs
General Random Sequences and Learnable Sequences. J. Symb. Log. 42 (3) (1977)
Claus-Peter Schnorr
An algorithm for stransitive closure with linear expected time. Theoretical Computer Science (1977)
Claus-Peter Schnorr
Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials. MFCS (1977)
Claus-Peter Schnorr
The Combinational Complexity of Equivalence. Theor. Comput. Sci. 1 (4) (1976)
Claus-Peter Schnorr
A Lower Bound on the Number of Additions in Monotone Computations. Theor. Comput. Sci. 2 (3) (1976)
Claus-Peter Schnorr
The Network Complexity and the Turing Machine Complexity of Finite Functions. Acta Informatica 7 (1976)
Claus-Peter Schnorr
Optimal Algorithms for Self-Reducible Problems. ICALP (1976)

Claus-Peter Schnorr.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Claus-Peter Schnorr