C. P. Schnorr

Generating author description...

All published works

Action	Title	Year	Authors
+	Is the RSA - Scheme safe? (Abstract)	2007	C. P. Schnorr
+	Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation	2007	C. P. Schnorr
+ PDF Chat	Enhancing the security of perfect blind DL-signatures	2005	C. P. Schnorr
+ PDF Chat	Security of Blind Discrete Log Signatures against Interactive Attacks	2001	C. P. Schnorr
+	The Generalized Gauss Reduction Algorithm	1996	Michael Kaib C. P. Schnorr
+ PDF Chat	An optimal, stable continued fraction algorithm for arbitrary dimension	1996	Carsten Rössner C. P. Schnorr
+	Factoring integers and computing discrete logarithms via diophantine approximation	1993	C. P. Schnorr
+	The multiplicative complexity of quadratic Boolean functions	1987	Roland Mirwald C. P. Schnorr
+	An efficient solution of the congruence&lt;tex&gt;x^2 + ky^2 = mpmod{n}&lt;/tex&gt;	1987	J. M. Pollard C. P. Schnorr
+ PDF Chat	An <i>O</i> ( <i>n</i> <sup>3</sup> log <i>n</i> ) deterministic and an <i>O</i> ( <i>n</i> <sup>3</sup> ) Las Vegs isomorphism test for trivalent graphs	1987	Zvi Galil Christoph M. Hoffmann Eugene M. Luks C. P. Schnorr Andreas Weber⋆
+	A Gödel Theorem on Network Complexity Lower Bounds	1986	C. P. Schnorr
+	Cryptanalysis of certain variants of Rabin's signature scheme	1984	Adi Shamir C. P. Schnorr
+ PDF Chat	A Monte Carlo Factoring Algorithm With Linear Storage	1984	C. P. Schnorr H. W. Lenstra
+	Signatures Through Approximate Representations by Quadratic Forms	1984	H. Ong C. P. Schnorr
+	An O(n3 log n) deterministic and an O (n 3) probabilistic isomorphism test for trivalent graphs	1982	Zvi Galil Christof M. Hoffmann Eugene M. Luks C. P. Schnorr Andreas Weber⋆
+	Ein effizienzvergleich der Faktorisierungsverfahren von Morrison-Hrillhart und Schroeppel	1982	J. Sattler C. P. Schnorr
+	An Extension of Strassen’s Degree Bound	1981	C. P. Schnorr
+	Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials	1978	C. P. Schnorr
+	Multiterminal Network Flow and Connectivity in Unsymmetrical Networks	1978	C. P. Schnorr
+	A Survey of the Theory of Random Sequences	1977	C. P. Schnorr
+	Rekursive Aufzählungen	1974	C. P. Schnorr
+	Das Rekursionstheorem und Anwendungen	1974	C. P. Schnorr
+	Darstellung des starken Gesetzes der großen Zahlen durch Martingale	1971	C. P. Schnorr
+	Zufallsfolgen zu Wahrscheinlichkeitsmaßen auf R	1971	C. P. Schnorr
+	Charakterisierung der Zufallsfolgen durch konstruktive Nullmengen nach L.E.J. BROUWER	1971	C. P. Schnorr
+ PDF Chat	�ber die Definition von effektiven Zufallstests	1970	C. P. Schnorr
+ PDF Chat	�ber die Definition von effektiven Zufallstests	1970	C. P. Schnorr

Common Coauthors

Coauthor	Papers Together
Andreas Weber⋆	2
Zvi Galil	2
Eugene M. Luks	2
J. M. Pollard	1
Roland Mirwald	1
Carsten Rössner	1
Jürgen Sattler	1
Christoph M. Hoffmann	1
H. W. Lenstra	1
Adi Shamir	1
H. Ong	1
Michael Kaib	1
Christof M. Hoffmann	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Factoring polynomials with rational coefficients	1982	A. K. Lenstra H. W. Lenstra László Lovász	5
+ PDF Chat	A method of factoring and the factorization of 𝐹₇	1975	Michael A. Morrison John Brillhart	3
+ PDF Chat	Eine Bemerkung zum Begriff der zuf�lligen Folge	1969	Claus-Peter Schnorr	3
+ PDF Chat	A Note on Security Proofs in the Generic Model	2000	Marc Fischlin	2
+ PDF Chat	Polynomial-time algorithms for permutation groups	1980	Merrick L. Furst John E. Hopcroft Eugene M. Luks	2
+	Note on Probability	1936	J. L. Doob	2
+	The definition of random sequences	1966	Per Martin-Löf	2
+	On the calculation of regulators and class numbers of quadratic fields	1982	H. W. Lenstra	1
+	Rational Quadratic Forms	1982	J. W. S. Cassels	1
+	An elementary proof for strassen's degree bound	1976	Arnold Schönhage	1
+	Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials	1978	C. P. Schnorr	1
+	Optimal Evaluation of Pairs of Bilinear Forms	1979	Joseph F. JáJá	1
+ PDF Chat	Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice	1990	Jeffrey C. Lagarias H. W. Lenstra C. P. Schnorr	1
+	Isomorphism of graphs of bounded valence can be tested in polynomial time	1982	Eugene M. Luks	1
+	Lower bounds for polynomials with algebraic coefficients	1980	Joos Heintz Malte Sieveking	1
+	A Gödel Theorem on Network Complexity Lower Bounds	1986	C. P. Schnorr	1
+	Numbers with small prime factors, and the least 𝑘th power non-residue	1971	Karl K. Norton	1
+	Methods for Investigating Connectivity of Large Graphs	1969	Daniel J. Kleitman	1
+	Graph isomorphism, general remarks	1979	Gary L. Miller	1
+	On the Complexity of Bilinear Forms with Commutativity	1980	Joseph F. JáJá	1
+ PDF Chat	Ueber einen das System zweier Fl�chen 2. Grades betreffenden Satz und einen damit verbundenen Strahlencomplex 2. Grades	1883	Friedrich Schur	1
+	THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS	1970	Alexander K. Zvonkin Leonid A. Levin	1
+	Isomorphism of graphs of bounded valence can be tested in polynomial time	1980	Eugene M. Luks	1
+	On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials	1973	Michael S. Paterson Larry J. Stockmeyer	1
+	Über die mittlere Schrittanzahl bei Divisionsalgorithmen	1978	G. J. Rieger	1
+	Solving bivariate quadratic congruences in random polynomial time	1987	Leonard M. Adleman Dennis R. Estes Kevin S. McCurley	1
+	Polynomials with 0-1 coefficients that are hard to evaluate	1975	Richard J. Lipton	1
+ PDF Chat	On the rapid computation of various polylogarithmic constants	1997	David H. Bailey Peter Borwein Simon Plouffe	1
+	Evaluation of polynomials with super-preconditioning	1976	Richard J. Lipton Larry J. Stockmeyer	1
+	Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions	1992	Bettina Just	1
+	On a problem of Oppenheim concerning “factorisatio numerorum”	1983	E. Rodney Canfield Paul Erdős Carl Pomerance	1
+	A family of cubical graphs	1947	W. T. Tutte	1
+	The computational complexity of simultaneous Diophantine approximation problems	1982	Jeffrey C. Lagarias	1
+	Factoring polynomials with rational coeficients	1982	H. W. Lenstra Arjen K. Lenstra L. Lovfiasz	1
+	Improved algorithms for integer programming and related lattice problems	1983	Ravi Kannan	1
+	An exposition of Pollard''s algorithm for quadratic congruences	1984	Jeffrey Shallit	1
+ PDF Chat	�ber die Definition von effektiven Zufallstests	1970	C. P. Schnorr	1
+	Basic algebra	1974	Nathan Jacobson	1
+	Geometric Algebra	1957	Emil Artin	1
+ PDF Chat	Elementary Number Theory	1940	G. F. Cramer J. V. Uspensky M. A. Heaslet	1
+	A Course in Arithmetic	1973	Jean-Pierre Serre	1
+	A Method of Factoring and the Factorization of F 7	1975	Michael A. Morrison John Brillhart	1
+	Algebraic Geometry	1977	Robin Hartshorne	1
+	Disquisitiones Arithmeticae	1986	Carl Friedrich Gauß	1
+ PDF Chat	Elementary Algebraic Geometry	1977	Keith Kendig	1
+ PDF Chat	Computational Problems, Methods, and Results in Algebraic Number Theory	1972	Horst G. Zimmer	1
+ PDF Chat	An Introduction To The Theory Of Numbers	2008	G. H. Hardy E. M. Wright	1
+	Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields	2007	Dennis R. Estes Leonard M. Adleman Kireeti Kompella Kevin S. McCurley Gary L. Miller	1
+	Des factions continues a la reduction des reseaux : analyse en moyenne	1993	Hervé Daudé	1
+	Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation	2007	C. P. Schnorr	1