| 2007 |
|---|
| 102 | EE | Rupert J. Hartung,
Claus-Peter Schnorr:
Public Key Identification Based on the Equivalence of Quadratic Forms.
MFCS 2007: 333-345 |
| 2006 |
|---|
| 101 | EE | Claus-Peter Schnorr:
Fast LLL-type lattice reduction.
Inf. Comput. 204(1): 1-25 (2006) |
| 100 | EE | Claus-Peter Schnorr:
Enhancing the security of perfect blind DL-signatures.
Inf. Sci. 176(10): 1305-1320 (2006) |
| 2003 |
|---|
| 99 | EE | Claus-Peter Schnorr:
Lattice Reduction by Random Sampling and Birthday Methods.
STACS 2003: 145-156 |
| 2001 |
|---|
| 98 | EE | Henrik Koy,
Claus-Peter Schnorr:
Segment LLL-Reduction of Lattice Bases.
CaLC 2001: 67-80 |
| 97 | EE | Henrik Koy,
Claus-Peter Schnorr:
Segment LLL-Reduction with Floating Point Orthogonalization.
CaLC 2001: 81-96 |
| 96 | EE | Claus-Peter Schnorr:
Security of Blind Discrete Log Signatures against Interactive Attacks.
ICICS 2001: 1-12 |
| 95 | EE | Feng Bao,
Robert H. Deng,
Willi Geiselmann,
Claus-Peter Schnorr,
Rainer Steinwandt,
Hongjun Wu:
Cryptoanalysis of Two Sparse Polynomial Based Public Key Cryptosystems.
Public Key Cryptography 2001: 153-164 |
| 94 | EE | Claus-Peter Schnorr:
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys.
Inf. Process. Lett. 79(2): 93-98 (2001) |
| 2000 |
|---|
| 93 | EE | Claus-Peter Schnorr,
Markus Jakobsson:
Security of Signed ElGamal Encryption.
ASIACRYPT 2000: 73-89 |
| 92 | EE | Roger Fischlin,
Claus-Peter Schnorr:
Stronger Security Proofs for RSA and Rabin Bits.
J. Cryptology 13(2): 221-244 (2000) |
| 1999 |
|---|
| 91 | | Markus Jakobsson,
Claus-Peter Schnorr:
Efficient Oblivious Proofs of Correct Exponentiation.
Communications and Multimedia Security 1999: 71-86 |
| 1998 |
|---|
| 90 | EE | 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 |
| 89 | EE | Claus-Peter Schnorr:
Security of Allmost ALL Discrete Log Bits
Electronic Colloquium on Computational Complexity (ECCC) 5(33): (1998) |
| 88 | EE | Claus-Peter Schnorr,
Serge Vaudenay:
The Black-Box Model for Cryptographic Primitives.
J. Cryptology 11(2): 125-140 (1998) |
| 1997 |
|---|
| 87 | EE | Roger Fischlin,
Claus-Peter Schnorr:
Stronger Security Proofs for RSA and Rabin Bits.
EUROCRYPT 1997: 267-279 |
| 1996 |
|---|
| 86 | EE | Claus-Peter Schnorr:
Security of 2^t-Root Identification and Signatures.
CRYPTO 1996: 143-156 |
| 85 | | Carsten Rössner,
Claus-Peter Schnorr:
An Optimal, Stable Continued Fraction Algorithm.
IPCO 1996: 31-43 |
| 84 | EE | Claus-Peter Schnorr:
Security of 2t-Root Identification and Signatures
Electronic Colloquium on Computational Complexity (ECCC) 3(19): (1996) |
| 83 | EE | Carsten Rössner,
Claus-Peter Schnorr:
An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension
Electronic Colloquium on Computational Complexity (ECCC) 3(20): (1996) |
| 82 | | Michael Kaib,
Claus-Peter Schnorr:
The Generalized Gauss Reduction Algorithm.
J. Algorithms 21(3): 565-578 (1996) |
| 1995 |
|---|
| 81 | EE | Claus-Peter Schnorr,
Horst Helmut Hörner:
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction.
EUROCRYPT 1995: 1-12 |
| 80 | | Carsten Rössner,
Claus-Peter Schnorr:
Computation of Highly Regular Nearby Points.
ISTCS 1995: 174-181 |
| 79 | EE | Claus-Peter Schnorr,
Horst Helmut Hörner:
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
Electronic Colloquium on Computational Complexity (ECCC) 2(26): (1995) |
| 1994 |
|---|
| 78 | EE | Claus-Peter Schnorr,
Serge Vaudenay:
Black Box Cryptoanalysis of Hash Networks Based on Multipermutations.
EUROCRYPT 1994: 47-57 |
| 77 | | Claus-Peter Schnorr:
Block Reduced Lattice Bases and Successive Minima.
Combinatorics, Probability & Computing 3: 507-522 (1994) |
| 76 | | Claus-Peter Schnorr,
M. Euchner:
Lattice basis reduction: Improved practical algorithms and solving subset sum problems.
Math. Program. 66: 181-199 (1994) |
| 1993 |
|---|
| 75 | | Claus-Peter Schnorr,
Serge Vaudenay:
Parallel FFT-Hashing.
FSE 1993: 149-156 |
| 74 | | Harald Niederreiter,
Claus-Peter Schnorr:
Local Randomness in Polynomial Random Number and Random Function Generators.
SIAM J. Comput. 22(4): 684-694 (1993) |
| 1992 |
|---|
| 73 | EE | Harald Niederreiter,
Claus-Peter Schnorr:
Local Randomness in Candidate One-Way Functions.
EUROCRYPT 1992: 408-419 |
| 72 | EE | Claus-Peter Schnorr:
FFT-Hash II, Efficient Cryptographic Hashing.
EUROCRYPT 1992: 45-54 |
| 71 | | Matthijs J. Coster,
Antoine Joux,
Brian A. LaMacchia,
Andrew M. Odlyzko,
Claus-Peter Schnorr,
Jacques Stern:
Improved Low-Density Subset Sum Algorithms.
Computational Complexity 2: 111-128 (1992) |
| 70 | | Roland Mirwald,
Claus-Peter Schnorr:
The Multiplicative Complexity of Quadratic Boolean Forms.
Theor. Comput. Sci. 102(2): 307-328 (1992) |
| 1991 |
|---|
| 69 | EE | Claus-Peter Schnorr:
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations.
EUROCRYPT 1991: 281-293 |
| 68 | | Claus-Peter Schnorr,
M. Euchner:
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems.
FCT 1991: 68-85 |
| 67 | | Silvio Micali,
Claus-Peter Schnorr:
Efficient, Perfect Polynomial Random Number Generators.
J. Cryptology 3(3): 157-172 (1991) |
| 66 | | Claus-Peter Schnorr:
Efficient Signature Generation by Smart Cards.
J. Cryptology 4(3): 161-174 (1991) |
| 1990 |
|---|
| 65 | EE | H. Ong,
Claus-Peter Schnorr:
Fast Signature Generation With a Fiat Shamir-Like Scheme.
EUROCRYPT 1990: 432-440 |
| 64 | | J. C. Lagarias,
Hendrik W. Lenstra Jr.,
Claus-Peter Schnorr:
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice.
Combinatorica 10(4): 333-348 (1990) |
| 1989 |
|---|
| 63 | EE | Claus-Peter Schnorr:
Efficient Identification and Signatures for Smart Cards.
CRYPTO 1989: 239-252 |
| 62 | EE | Claus-Peter Schnorr:
Efficient Identification and Signatures for Smart Cards (Abstract).
EUROCRYPT 1989: 688-689 |
| 61 | | 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 |
|---|
| 60 | | Claus-Peter Schnorr:
The Multiplicative Complexity of Boolean Functions.
AAECC 1988: 45-58 |
| 59 | EE | Silvio Micali,
Claus-Peter Schnorr:
Efficient, Perfect Random Number Generators.
CRYPTO 1988: 173-198 |
| 58 | EE | Claus-Peter Schnorr:
On the Construction of Random Number Generators and Random Function Generators.
EUROCRYPT 1988: 225-232 |
| 57 | | Claus-Peter Schnorr:
Geometry of Numbers and Integer Programming (Summary).
STACS 1988: 1-7 |
| 56 | | Claus-Peter Schnorr:
A More Efficient Algorithm for Lattice Basis Reduction.
J. Algorithms 9(1): 47-62 (1988) |
| 55 | | 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 |
|---|
| 54 | | Roland Mirwald,
Claus-Peter Schnorr:
The Multiplicative Complexity of Quadratic Boolean Forms
FOCS 1987: 141-150 |
| 53 | | Azaria Paz,
Claus-Peter Schnorr:
Approximating Integer Lattices by Lattices with Cyclic Factor Groups.
ICALP 1987: 386-393 |
| 52 | | John M. Pollard,
Claus-Peter Schnorr:
An efficient solution of the congruence x2+ky2=mpmod{n}.
IEEE Transactions on Information Theory 33(5): 702-709 (1987) |
| 51 | EE | 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) |
| 50 | | Claus-Peter Schnorr:
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms.
Theor. Comput. Sci. 53: 201-224 (1987) |
| 1986 |
|---|
| 49 | | Claus-Peter Schnorr:
A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract).
ICALP 1986: 359-369 |
| 48 | | 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 |
| 47 | | Claus-Peter Schnorr,
Adi Shamir:
An Optimal Sorting Algorithm for Mesh Connected Computers
STOC 1986: 255-263 |
| 1984 |
|---|
| 46 | EE | H. Ong,
Claus-Peter Schnorr,
Adi Shamir:
Efficient Signature Schemes Based on Polynomial Equations.
CRYPTO 1984: 37-46 |
| 45 | EE | Claus-Peter Schnorr,
Werner Alexi:
RSA-Bits are 0.5 + epsilon Secure.
EUROCRYPT 1984: 113-126 |
| 44 | | Werner Alexi,
Benny Chor,
Oded Goldreich,
Claus-Peter Schnorr:
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure
FOCS 1984: 449-457 |
| 43 | | H. Ong,
Claus-Peter Schnorr,
Adi Shamir:
An Efficient Signature Scheme Based on Quadratic Equations
STOC 1984: 208-216 |
| 42 | | Adi Shamir,
Claus-Peter Schnorr:
Cryptanalysis of Certain Variants of Rabin's Signature Scheme.
Inf. Process. Lett. 19(3): 113-115 (1984) |
| 1983 |
|---|
| 41 | | H. Ong,
Claus-Peter Schnorr:
Signatures through Approximate Representation by Quadratic Forms.
CRYPTO 1983: 117-131 |
| 40 | | Claus-Peter Schnorr:
Monte-Carlo factoring algorithm with finite storage.
Theoretical Computer Science 1983: 19-33 |
| 1982 |
|---|
| 39 | EE | Claus-Peter Schnorr:
Is the RSA Scheme Safe?
EUROCRYPT 1982: 325-329 |
| 38 | EE | Jürgen Sattler,
Claus-Peter Schnorr:
Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel.
EUROCRYPT 1982: 331-351 |
| 37 | | 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 |
| 36 | | Claus-Peter Schnorr:
Refined Analysis and Improvements on Some Factoring Algorithms.
J. Algorithms 3(2): 101-127 (1982) |
| 1981 |
|---|
| 35 | | Claus-Peter Schnorr:
Refined Analysis and Improvements on Some Factoring Algorithms.
ICALP 1981: 1-15 |
| 34 | | Claus-Peter Schnorr:
How Many Polynomials can be Approximated Faster Than They can be Evaluated?
Inf. Process. Lett. 12(2): 76-78 (1981) |
| 33 | | Claus-Peter Schnorr:
An Extension of Strassen's Degree Bound.
SIAM J. Comput. 10(2): 371-382 (1981) |
| 1980 |
|---|
| 32 | | Joos Heintz,
Claus-Peter Schnorr:
Testing Polynomials which Are Easy to Compute (Extended Abstract)
STOC 1980: 262-272 |
| 31 | | Claus-Peter Schnorr,
Jean-Paul Van de Wiele:
On the Additive Complexity of Polynomials.
Theor. Comput. Sci. 10: 1-18 (1980) |
| 30 | | Claus-Peter Schnorr:
A 3n-Lower Bound on the Network Complexity of Boolean Functions.
Theor. Comput. Sci. 10: 83-92 (1980) |
| 1979 |
|---|
| 29 | | Claus-Peter Schnorr:
On the Additive Complexity of Polynomials and some New Lower Bounds.
Theoretical Computer Science 1979: 286-297 |
| 28 | | Claus-Peter Schnorr:
Bottlenecks and Edge Connectivity in Unsymmetrical Networks.
SIAM J. Comput. 8(2): 265-274 (1979) |
| 1978 |
|---|
| 27 | | Claus-Peter Schnorr:
Multiterminal Network Flow and Connectivity in Unsymmetrical Networks.
ICALP 1978: 425-439 |
| 26 | EE | Claus-Peter Schnorr:
Satisfiability Is Quasilinear Complete in NQL.
J. ACM 25(1): 136-145 (1978) |
| 25 | | Claus-Peter Schnorr:
An Algorithm for Transitive Closure with Linear Expected Time.
SIAM J. Comput. 7(2): 127-133 (1978) |
| 24 | | 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 |
|---|
| 23 | | Claus-Peter Schnorr:
Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials.
MFCS 1977: 135-147 |
| 22 | | Claus-Peter Schnorr:
An algorithm for stransitive closure with linear expected time.
Theoretical Computer Science 1977: 329-338 |
| 21 | | 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 |
| 20 | | 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) |
| 19 | | Claus-Peter Schnorr,
P. Fuchs:
General Random Sequences and Learnable Sequences.
J. Symb. Log. 42(3): 329-340 (1977) |
| 1976 |
|---|
| 18 | | Claus-Peter Schnorr:
Optimal Algorithms for Self-Reducible Problems.
ICALP 1976: 322-337 |
| 17 | | Claus-Peter Schnorr:
The Network Complexity and the Turing Machine Complexity of Finite Functions
Acta Inf. 7: 95-107 (1976) |
| 16 | | Claus-Peter Schnorr:
The Combinational Complexity of Equivalence.
Theor. Comput. Sci. 1(4): 289-295 (1976) |
| 15 | | Claus-Peter Schnorr:
A Lower Bound on the Number of Additions in Monotone Computations.
Theor. Comput. Sci. 2(3): 305-315 (1976) |
| 1975 |
|---|
| 14 | | Claus-Peter Schnorr:
The network-complexity of equivalence and other applications of the network complexity.
Automata Theory and Formal Languages 1975: 83-92 |
| 13 | | Claus-Peter Schnorr:
Optimal Enumerations and Optimal Gödel Numberings.
Mathematical Systems Theory 8(2): 182-191 (1975) |
| 1974 |
|---|
| 12 | | Claus-Peter Schnorr:
On Maximal Merging of Information in Boolean Computations.
ICALP 1974: 294-300 |
| 1973 |
|---|
| 11 | | Claus-Peter Schnorr:
Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations.
MFCS 1973: 153-161 |
| 10 | | Claus-Peter Schnorr:
Process Complexity and Effective Random Tests.
J. Comput. Syst. Sci. 7(4): 376-388 (1973) |
| 1972 |
|---|
| 9 | | Claus-Peter Schnorr:
Does the Computational Speed-up Concern Programming?
ICALP 1972: 585-591 |
| 8 | | Claus-Peter Schnorr:
The Process Complexity and Effective Random Tests
STOC 1972: 168-176 |
| 7 | | Claus-Peter Schnorr,
H. Stimm:
Endliche Automaten und Zufallsfolgen
Acta Inf. 1: 345-359 (1972) |
| 1971 |
|---|
| 6 | | Claus-Peter Schnorr:
Optimal Gödel Numberings.
IFIP Congress (1) 1971: 56-58 |
| 5 | | Claus-Peter Schnorr:
A Unified Approach to the Definition of Random Sequences.
Mathematical Systems Theory 5(3): 246-258 (1971) |
| 1969 |
|---|
| 4 | | Claus-Peter Schnorr,
Hermann Walter:
Pullbackkonstruktionen bei Semi-Thuesystemen.
Elektronische Informationsverarbeitung und Kybernetik 5(1): 27-36 (1969) |
| 3 | | Claus-Peter Schnorr:
Transformational Classes of Grammars
Information and Control 14(3): 252-277 (1969) |
| 2 | | Claus-Peter Schnorr:
Errata: ``Transformational Classes of Grammars''
Information and Control 15(2): 207 (1969) |
| 1967 |
|---|
| 1 | | Claus-Peter Schnorr:
Freie assoziative Systeme.
Elektronische Informationsverarbeitung und Kybernetik 3(6): 319-340 (1967) |
