Claus-Peter Schnorr

121 papers A* 33A 4B 5C 1Journal 58Unranked 15
YearRankTypeTitle / Venue / Authors
2021 J jnl
Fast Factoring Integers by SVP Algorithms, corrected.
IACR Cryptol. ePrint Arch.
Claus-Peter Schnorr
2014 J jnl
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers.
SIAM J. Comput.
Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr
2013 — conf
Factoring Integers by CVP Algorithms.
Number Theory and Cryptography
Claus-Peter Schnorr
2012 J jnl
Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction.
IACR Cryptol. ePrint Arch.
Claus-Peter Schnorr, Taras Shevchenko
2011 J jnl
Accelerated Slide- and LLL-Reduction.
Electron. Colloquium Comput. Complex.
Claus-Peter Schnorr
2010 — ch.
Progress on LLL and Lattice Reduction.
The LLL Algorithm
Claus-Peter Schnorr
2008 J jnl
Identification and signatures based on NP-hard problems of indefinite quadratic forms.
J. Math. Cryptol.
Rupert J. Hartung, Claus-Peter Schnorr
2007 B conf
Public Key Identification Based on the Equivalence of Quadratic Forms.
MFCS
Rupert J. Hartung, Claus-Peter Schnorr
2006 J jnl
Enhancing the security of perfect blind DL-signatures.
Inf. Sci.
Claus-Peter Schnorr
2006 J jnl
Fast LLL-type lattice reduction.
Inf. Comput.
Claus-Peter Schnorr
2003 A conf
Lattice Reduction by Random Sampling and Birthday Methods.
STACS
Claus-Peter Schnorr
2001 — conf
Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems.
Public Key Cryptography
Feng Bao, Robert H. Deng, Willi Geiselmann, Claus-Peter Schnorr, Rainer Steinwandt, Hongjun Wu
2001 C conf
Security of Blind Discrete Log Signatures against Interactive Attacks.
ICICS
Claus-Peter Schnorr
2001 — conf
Segment LLL-Reduction of Lattice Bases.
CaLC
Henrik Koy, Claus-Peter Schnorr
2001 — conf
Segment LLL-Reduction with Floating Point Orthogonalization.
CaLC
Henrik Koy, Claus-Peter Schnorr
2001 J jnl
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys.
Inf. Process. Lett.
Claus-Peter Schnorr
2000 A conf
Security of Signed ElGamal Encryption.
ASIACRYPT
Claus-Peter Schnorr, Markus Jakobsson
2000 J jnl
Stronger Security Proofs for RSA and Rabin Bits.
J. Cryptol.
Roger Fischlin, Claus-Peter Schnorr
1999 — conf
Efficient Oblivious Proofs of Correct Exponentiation.
Communications and Multimedia Security
Markus Jakobsson, Claus-Peter Schnorr
1998 J jnl
Almost All Discrete Log Bits Are Simultaneously Secure.
IACR Cryptol. ePrint Arch.
Claus-Peter Schnorr
1998 — conf
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).
RANDOM
Claus-Peter Schnorr, C. R. Subramanian
1998 J jnl
Security of Allmost ALL Discrete Log Bits
Electron. Colloquium Comput. Complex.
Claus-Peter Schnorr
1998 J jnl
The Black-Box Model for Cryptographic Primitives.
J. Cryptol.
Claus-Peter Schnorr, Serge Vaudenay
1997 A* conf
Stronger Security Proofs for RSA and Rabin Bits.
EUROCRYPT
Roger Fischlin, Claus-Peter Schnorr
1996 J jnl
An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension
Electron. Colloquium Comput. Complex.
Carsten Rössner, Claus-Peter Schnorr
1996 B conf
An Optimal, Stable Continued Fraction Algorithm.
IPCO
Carsten Rössner, Claus-Peter Schnorr
1996 J jnl
Security of 2
Electron. Colloquium Comput. Complex.
Claus-Peter Schnorr
1996 A* conf
Security of 2^t-Root Identification and Signatures.
CRYPTO
Claus-Peter Schnorr
1996 J jnl
The Generalized Gauss Reduction Algorithm.
J. Algorithms
Michael Kaib, Claus-Peter Schnorr
1995 J jnl
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
Electron. Colloquium Comput. Complex.
Claus-Peter Schnorr, Horst Helmut Hörner
1995 A* conf
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction.
EUROCRYPT
Claus-Peter Schnorr, Horst Helmut Hörner
1995 — conf
Computation of Highly Regular Nearby Points.
ISTCS
Carsten Rössner, Claus-Peter Schnorr
1994 A* conf
Black Box Cryptanalysis of Hash Networks Based on Multipermutations.
EUROCRYPT
Claus-Peter Schnorr, Serge Vaudenay
1994 J jnl
Block Reduced Lattice Bases and Successive Minima.
Comb. Probab. Comput.
Claus-Peter Schnorr
1994 J jnl
Lattice basis reduction: Improved practical algorithms and solving subset sum problems.
Math. Program.
Claus-Peter Schnorr, M. Euchner
1993 J jnl
Local Randomness in Polynomial Random Number and Random Function Generators.
SIAM J. Comput.
Harald Niederreiter, Claus-Peter Schnorr
1993 A* conf
Parallel FFT-Hashing.
FSE
Claus-Peter Schnorr, Serge Vaudenay
1992 — ch.
Computation of the Boolean Matrix-Vector, AND/OR-Produkt in Average Time O(m + nlnn).
Informatik
Claus-Peter Schnorr
1992 A* conf
FFT-Hash II, Efficient Cryptographic Hashing.
EUROCRYPT
Claus-Peter Schnorr
1992 J jnl
Improved Low-Density Subset Sum Algorithms.
Comput. Complex.
Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern
1992 A* conf
Local Randomness in Candidate One-Way Functions.
EUROCRYPT
Harald Niederreiter, Claus-Peter Schnorr
1992 J jnl
The Multiplicative Complexity of Quadratic Boolean Forms.
Theor. Comput. Sci.
Roland Mirwald, Claus-Peter Schnorr
1991 A* conf
An Improved Low-Denisty Subset Sum Algorithm.
EUROCRYPT
Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr
1991 J jnl
Efficient Signature Generation by Smart Cards.
J. Cryptol.
Claus-Peter Schnorr
1991 J jnl
Efficient, Perfect Polynomial Random Number Generators.
J. Cryptol.
Silvio Micali, Claus-Peter Schnorr
1991 A* conf
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations.
EUROCRYPT
Claus-Peter Schnorr
1991 B conf
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems.
FCT
Claus-Peter Schnorr, M. Euchner
1990 — conf
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation.
Advances In Computational Complexity Theory
Claus-Peter Schnorr
1990 A* conf
Fast Signature Generation With a Fiat Shamir-Like Scheme.
EUROCRYPT
H. Ong, Claus-Peter Schnorr
1990 J jnl
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice.
Comb.
J. C. Lagarias, Hendrik W. Lenstra Jr., Claus-Peter Schnorr
1989 A* conf
Efficient Identification and Signatures for Smart Cards (Abstract).
EUROCRYPT
Claus-Peter Schnorr
1989 A* conf
Efficient Identification and Signatures for Smart Cards.
CRYPTO
Claus-Peter Schnorr
1989 J jnl
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers.
SIAM J. Comput.
Johan Håstad, Bettina Just, J. C. Lagarias, Claus-Peter Schnorr
1988 J jnl
A More Efficient Algorithm for Lattice Basis Reduction.
J. Algorithms
Claus-Peter Schnorr
1988 A* conf
Efficient, Perfect Random Number Generators.
CRYPTO
Silvio Micali, Claus-Peter Schnorr
1988 A conf
Geometry of Numbers and Integer Programming (Summary).
STACS
Claus-Peter Schnorr
1988 A* conf
On the Construction of Random Number Generators and Random Function Generators.
EUROCRYPT
Claus-Peter Schnorr
1988 J jnl
RSA and Rabin Functions: Certain Parts are as Hard as the Whole.
SIAM J. Comput.
Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
1988 — conf
The Multiplicative Complexity of Boolean Functions.
AAECC
Claus-Peter Schnorr
1987 J jnl
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms.
Theor. Comput. Sci.
Claus-Peter Schnorr
1987 J jnl
An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs.
J. ACM
Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
1987 J jnl
An efficient solution of the congruence x
IEEE Trans. Inf. Theory
John M. Pollard, Claus-Peter Schnorr
1987 A* conf
Approximating Integer Lattices by Lattices with Cyclic Factor Groups.
ICALP
Azaria Paz, Claus-Peter Schnorr
1987 A* conf
The Multiplicative Complexity of Quadratic Boolean Forms
FOCS
Roland Mirwald, Claus-Peter Schnorr
1986 J jnl
A Gödel Theorem on Network Complexity Lower Bounds.
Math. Log. Q.
Claus-Peter Schnorr
1986 A* conf
A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract).
ICALP
Claus-Peter Schnorr
1986 A* conf
An Optimal Sorting Algorithm for Mesh Connected Computers
STOC
Claus-Peter Schnorr, Adi Shamir
1986 A conf
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers.
STACS
Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr
1984 A* conf
An Efficient Signature Scheme Based on Quadratic Equations
STOC
H. Ong, Claus-Peter Schnorr, Adi Shamir
1984 J jnl
Cryptanalysis of Certain Variants of Rabin's Signature Scheme.
Inf. Process. Lett.
Adi Shamir, Claus-Peter Schnorr
1984 A* conf
Efficient Signature Schemes Based on Polynomial Equations.
CRYPTO
H. Ong, Claus-Peter Schnorr, Adi Shamir
1984 A* conf
RSA-Bits are 0.5 + epsilon Secure.
EUROCRYPT
Claus-Peter Schnorr, Werner Alexi
1984 A* conf
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure
FOCS
Werner Alexi, Benny Chor, Oded Goldreich, Claus-Peter Schnorr
1983 J jnl
Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel.
Computing
Claus-Peter Schnorr, Jürgen Sattler
1983 — conf
Monte-Carlo factoring algorithm with finite storage.
Theoretical Computer Science
Claus-Peter Schnorr
1983 A* conf
Signatures through Approximate Representation by Quadratic Forms.
CRYPTO
H. Ong, Claus-Peter Schnorr
1982 A* conf
An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs
FOCS
Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
1982 A* conf
Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel.
EUROCRYPT
Jürgen Sattler, Claus-Peter Schnorr
1982 A* conf
Is the RSA Scheme Safe?
EUROCRYPT
Claus-Peter Schnorr
1982 J jnl
Refined Analysis and Improvements on Some Factoring Algorithms.
J. Algorithms
Claus-Peter Schnorr
1981 J jnl
An Extension of Strassen's Degree Bound.
SIAM J. Comput.
Claus-Peter Schnorr
1981 J jnl
How Many Polynomials can be Approximated Faster Than They can be Evaluated?
Inf. Process. Lett.
Claus-Peter Schnorr
1981 A* conf
Refined Analysis and Improvements on Some Factoring Algorithms.
ICALP
Claus-Peter Schnorr
1980 J jnl
A 3n-Lower Bound on the Network Complexity of Boolean Functions.
Theor. Comput. Sci.
Claus-Peter Schnorr
1980 J jnl
On the Additive Complexity of Polynomials.
Theor. Comput. Sci.
Claus-Peter Schnorr, Jean-Paul Van de Wiele
1980 A* conf
Testing Polynomials which Are Easy to Compute (Extended Abstract)
STOC
Joos Heintz, Claus-Peter Schnorr
1979 J jnl
Bottlenecks and Edge Connectivity in Unsymmetrical Networks.
SIAM J. Comput.
Claus-Peter Schnorr
1979 — conf
On the Additive Complexity of Polynomials and some New Lower Bounds.
Theoretical Computer Science
Claus-Peter Schnorr
1978 J jnl
An Algorithm for Transitive Closure with Linear Expected Time.
SIAM J. Comput.
Claus-Peter Schnorr
1978 J jnl
Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials.
Theor. Comput. Sci.
Claus-Peter Schnorr
1978 A* conf
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks.
ICALP
Claus-Peter Schnorr
1978 J jnl
Satisfiability Is Quasilinear Complete in NQL.
J. ACM
Claus-Peter Schnorr
1977 J jnl
A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors.
Inf. Process. Lett.
Claus-Peter Schnorr, H. Klupp
1977 — conf
An algorithm for stransitive closure with linear expected time.
Theoretical Computer Science
Claus-Peter Schnorr
1977 J jnl
General Random Sequences and Learnable Sequences.
J. Symb. Log.
Claus-Peter Schnorr, P. Fuchs
1977 B conf
Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials.
MFCS
Claus-Peter Schnorr
1977 — conf
Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen.
Theoretical Computer Science
C. Reynvaan, Claus-Peter Schnorr
1976 J jnl
A Lower Bound on the Number of Additions in Monotone Computations.
Theor. Comput. Sci.
Claus-Peter Schnorr
1976 A* conf
Optimal Algorithms for Self-Reducible Problems.
ICALP
Claus-Peter Schnorr
1976 J jnl
The Combinational Complexity of Equivalence.
Theor. Comput. Sci.
Claus-Peter Schnorr
1976 J jnl
The Network Complexity and the Turing Machine Complexity of Finite Functions.
Acta Informatica
Claus-Peter Schnorr
1975 J jnl
A characterization of complexity sequences.
Math. Log. Q.
Claus-Peter Schnorr, G. Stumpf
1975 J jnl
Optimal Enumerations and Optimal Gödel Numberings.
Math. Syst. Theory
Claus-Peter Schnorr
1975 — conf
The network-complexity of equivalence and other applications of the network complexity.
Automata Theory and Formal Languages
Claus-Peter Schnorr
1974 A* conf
On Maximal Merging of Information in Boolean Computations.
ICALP
Claus-Peter Schnorr
1974 — book
Rekursive Funktionen und ihre Komplexität.
Claus-Peter Schnorr
1974 J jnl
Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen.
Computing
Claus-Peter Schnorr
1973 B conf
Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations.
MFCS
Claus-Peter Schnorr
1973 J jnl
Process Complexity and Effective Random Tests.
J. Comput. Syst. Sci.
Claus-Peter Schnorr
1972 A* conf
Does the Computational Speed-up Concern Programming?
ICALP
Claus-Peter Schnorr
1972 J jnl
Endliche Automaten und Zufallsfolgen.
Acta Informatica
Claus-Peter Schnorr, H. Stimm
1972 A* conf
The Process Complexity and Effective Random Tests
STOC
Claus-Peter Schnorr
1971 J jnl
A Unified Approach to the Definition of Random Sequences.
Math. Syst. Theory
Claus-Peter Schnorr
1971 — conf
Optimal Gödel Numberings.
IFIP Congress (1)
Claus-Peter Schnorr
1971 — book
Zufälligkeit und Wahrscheinlichkeit - Eine algorithmische Begründung der Wahrscheinlichkeitstheorie.
Claus-Peter Schnorr
1969 J jnl
Errata: "Transformational Classes of Grammars"
Inf. Control.
Claus-Peter Schnorr
1969 J jnl
Pullbackkonstruktionen bei Semi-Thuesystemen.
J. Inf. Process. Cybern.
Claus-Peter Schnorr, Hermann K.-G. Walter
1969 J jnl
Transformational Classes of Grammars
Inf. Control.
Claus-Peter Schnorr
1968 J jnl
Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen.
Computing
Claus-Peter Schnorr
1967 — —
Darstellbarkeit von Sprachen durch freie assoziative Systeme.
Claus-Peter Schnorr
1967 J jnl
Freie assoziative Systeme.
J. Inf. Process. Cybern.
Claus-Peter Schnorr