Claus-Peter Schnorr

According to our database1, Claus-Peter Schnorr
  • authored at least 117 papers between 1967 and 2014.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2014
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers.
SIAM J. Comput., 2014

2013
Factoring Integers by CVP Algorithms.
Proceedings of the Number Theory and Cryptography, 2013

2012
Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction.
IACR Cryptology ePrint Archive, 2012

2011
Accelerated Slide- and LLL-Reduction.
Electronic Colloquium on Computational Complexity (ECCC), 2011

2010
Progress on LLL and Lattice Reduction.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

2008
Identification and signatures based on NP-hard problems of indefinite quadratic forms.
J. Mathematical Cryptology, 2008

2007
Public Key Identification Based on the Equivalence of Quadratic Forms.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Enhancing the security of perfect blind DL-signatures.
Inf. Sci., 2006

Fast LLL-type lattice reduction.
Inf. Comput., 2006

2003
Lattice Reduction by Random Sampling and Birthday Methods.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2001
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys.
Inf. Process. Lett., 2001

Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems.
Proceedings of the Public Key Cryptography, 2001

Security of Blind Discrete Log Signatures against Interactive Attacks.
Proceedings of the Information and Communications Security, Third International Conference, 2001

Segment LLL-Reduction with Floating Point Orthogonalization.
Proceedings of the Cryptography and Lattices, International Conference, 2001

Segment LLL-Reduction of Lattice Bases.
Proceedings of the Cryptography and Lattices, International Conference, 2001

2000
Stronger Security Proofs for RSA and Rabin Bits.
J. Cryptology, 2000

Security of Signed ElGamal Encryption.
Proceedings of the Advances in Cryptology, 2000

1999
Efficient Oblivious Proofs of Correct Exponentiation.
Proceedings of the Secure Information Networks: Communications and Multimedia Security, 1999

1998
The Black-Box Model for Cryptographic Primitives.
J. Cryptology, 1998

Almost All Discrete Log Bits Are Simultaneously Secure.
IACR Cryptology ePrint Archive, 1998

Security of Allmost ALL Discrete Log Bits
Electronic Colloquium on Computational Complexity (ECCC), 1998

Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997
Stronger Security Proofs for RSA and Rabin Bits.
Proceedings of the Advances in Cryptology, 1997

1996
The Generalized Gauss Reduction Algorithm.
J. Algorithms, 1996

An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension
Electronic Colloquium on Computational Complexity (ECCC), 1996

Security of 2t-Root Identification and Signatures
Electronic Colloquium on Computational Complexity (ECCC), 1996

An Optimal, Stable Continued Fraction Algorithm.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Security of 2^t-Root Identification and Signatures.
Proceedings of the Advances in Cryptology, 1996

1995
Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
Electronic Colloquium on Computational Complexity (ECCC), 1995

Computation of Highly Regular Nearby Points.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction.
Proceedings of the Advances in Cryptology, 1995

1994
Lattice basis reduction: Improved practical algorithms and solving subset sum problems.
Math. Program., 1994

Block Reduced Lattice Bases and Successive Minima.
Combinatorics, Probability & Computing, 1994

Black Box Cryptanalysis of Hash Networks Based on Multipermutations.
Proceedings of the Advances in Cryptology, 1994

1993
Local Randomness in Polynomial Random Number and Random Function Generators.
SIAM J. Comput., 1993

Parallel FFT-Hashing.
Proceedings of the Fast Software Encryption, 1993

1992
The Multiplicative Complexity of Quadratic Boolean Forms.
Theor. Comput. Sci., 1992

Improved Low-Density Subset Sum Algorithms.
Computational Complexity, 1992

FFT-Hash II, Efficient Cryptographic Hashing.
Proceedings of the Advances in Cryptology, 1992

Local Randomness in Candidate One-Way Functions.
Proceedings of the Advances in Cryptology, 1992

1991
Efficient Signature Generation by Smart Cards.
J. Cryptology, 1991

Efficient, Perfect Polynomial Random Number Generators.
J. Cryptology, 1991

Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations.
Proceedings of the Advances in Cryptology, 1991

1990
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice.
Combinatorica, 1990

Fast Signature Generation With a Fiat Shamir-Like Scheme.
Proceedings of the Advances in Cryptology, 1990

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation.
Proceedings of the Advances In Computational Complexity Theory, 1990

1989
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers.
SIAM J. Comput., 1989

Efficient Identification and Signatures for Smart Cards (Abstract).
Proceedings of the Advances in Cryptology, 1989

Efficient Identification and Signatures for Smart Cards.
Proceedings of the Advances in Cryptology, 1989

1988
RSA and Rabin Functions: Certain Parts are as Hard as the Whole.
SIAM J. Comput., 1988

A More Efficient Algorithm for Lattice Basis Reduction.
J. Algorithms, 1988

Geometry of Numbers and Integer Programming (Summary).
Proceedings of the STACS 88, 1988

On the Construction of Random Number Generators and Random Function Generators.
Proceedings of the Advances in Cryptology, 1988

Efficient, Perfect Random Number Generators.
Proceedings of the Advances in Cryptology, 1988

The Multiplicative Complexity of Boolean Functions.
Proceedings of the Applied Algebra, 1988

1987
An efficient solution of the congruence x2+ky2=mpmod{n}.
IEEE Trans. Information Theory, 1987

A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms.
Theor. Comput. Sci., 1987

An O(n³log n) deterministic and an O(n³) Las Vegs isomorphism test for trivalent graphs.
J. ACM, 1987

Approximating Integer Lattices by Lattices with Cyclic Factor Groups.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

The Multiplicative Complexity of Quadratic Boolean Forms
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
A Gödel Theorem on Network Complexity Lower Bounds.
Math. Log. Q., 1986

An Optimal Sorting Algorithm for Mesh Connected Computers
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers.
Proceedings of the STACS 86, 1986

A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984
Cryptanalysis of Certain Variants of Rabin's Signature Scheme.
Inf. Process. Lett., 1984

An Efficient Signature Scheme Based on Quadratic Equations
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

RSA-Bits are 0.5 + epsilon Secure.
Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

Efficient Signature Schemes Based on Polynomial Equations.
Proceedings of the Advances in Cryptology, 1984

1983
Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel.
Computing, 1983

Monte-Carlo factoring algorithm with finite storage.
Proceedings of the Theoretical Computer Science, 1983

Signatures through Approximate Representation by Quadratic Forms.
Proceedings of the Advances in Cryptology, 1983

1982
Refined Analysis and Improvements on Some Factoring Algorithms.
J. Algorithms, 1982

An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Is the RSA Scheme Safe?
Proceedings of the Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29, 1982

Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel.
Proceedings of the Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29, 1982

1981
An Extension of Strassen's Degree Bound.
SIAM J. Comput., 1981

How Many Polynomials can be Approximated Faster Than They can be Evaluated?
Inf. Process. Lett., 1981

Refined Analysis and Improvements on Some Factoring Algorithms.
Proceedings of the Automata, 1981

1980
On the Additive Complexity of Polynomials.
Theor. Comput. Sci., 1980

A 3n-Lower Bound on the Network Complexity of Boolean Functions.
Theor. Comput. Sci., 1980

Testing Polynomials which Are Easy to Compute (Extended Abstract)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979
Bottlenecks and Edge Connectivity in Unsymmetrical Networks.
SIAM J. Comput., 1979

On the Additive Complexity of Polynomials and some New Lower Bounds.
Proceedings of the Theoretical Computer Science, 1979

1978
Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials.
Theor. Comput. Sci., 1978

An Algorithm for Transitive Closure with Linear Expected Time.
SIAM J. Comput., 1978

Satisfiability Is Quasilinear Complete in NQL.
J. ACM, 1978

Multiterminal Network Flow and Connectivity in Unsymmetrical Networks.
Proceedings of the Automata, 1978

1977
General Random Sequences and Learnable Sequences.
J. Symb. Log., 1977

A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors.
Inf. Process. Lett., 1977

An algorithm for stransitive closure with linear expected time.
Proceedings of the Theoretical Computer Science, 1977

Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen.
Proceedings of the Theoretical Computer Science, 1977

Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976
A Lower Bound on the Number of Additions in Monotone Computations.
Theor. Comput. Sci., 1976

The Combinational Complexity of Equivalence.
Theor. Comput. Sci., 1976

The Network Complexity and the Turing Machine Complexity of Finite Functions.
Acta Inf., 1976

Optimal Algorithms for Self-Reducible Problems.
ICALP, 1976

1975
Optimal Enumerations and Optimal Gödel Numberings.
Mathematical Systems Theory, 1975

A characterization of complexity sequences.
Math. Log. Q., 1975

The network-complexity of equivalence and other applications of the network complexity.
Proceedings of the Automata Theory and Formal Languages, 1975

1974
Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen.
Computing, 1974

On Maximal Merging of Information in Boolean Computations.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

1973
Process Complexity and Effective Random Tests.
J. Comput. Syst. Sci., 1973

Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972
Endliche Automaten und Zufallsfolgen.
Acta Inf., 1972

The Process Complexity and Effective Random Tests
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Does the Computational Speed-up Concern Programming?
ICALP, 1972

1971
A Unified Approach to the Definition of Random Sequences.
Mathematical Systems Theory, 1971

Optimal Gödel Numberings.
IFIP Congress (1), 1971

Zufälligkeit und Wahrscheinlichkeit - Eine algorithmische Begründung der Wahrscheinlichkeitstheorie.
Lecture Notes in Mathematics 218, Springer, ISBN: 978-3-540-05566-2, 1971

1969
Errata: "Transformational Classes of Grammars"
Information and Control, August, 1969

Transformational Classes of Grammars
Information and Control, March, 1969

Pullbackkonstruktionen bei Semi-Thuesystemen.
Elektronische Informationsverarbeitung und Kybernetik, 1969

1968
Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen.
Computing, 1968

1967
Darstellbarkeit von Sprachen durch freie assoziative Systeme.
PhD thesis, 1967

Freie assoziative Systeme.
Elektronische Informationsverarbeitung und Kybernetik, 1967


  Loading...