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