Claus-Peter Schnorr

IACR Cryptol. ePrint Arch., 2021

2014

Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers.

[BibT_eX]

[DOI]

SIAM J. Comput., 2014

2013

Factoring Integers by CVP Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Number Theory and Cryptography, 2013

2012

Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction.

[BibT_eX]

[DOI]

Taras Shevchenko

IACR Cryptol. ePrint Arch., 2012

2011

Accelerated Slide- and LLL-Reduction.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

2010

Progress on LLL and Lattice Reduction.

[BibT_eX]

[DOI]

Proceedings of the LLL Algorithm - Survey and Applications, 2010

2008

Identification and signatures based on NP-hard problems of indefinite quadratic forms.

[BibT_eX]

[DOI]

Rupert J. Hartung

J. Math. Cryptol., 2008

2007

Public Key Identification Based on the Equivalence of Quadratic Forms.

[BibT_eX]

[DOI]

Rupert J. Hartung

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Enhancing the security of perfect blind DL-signatures.

[BibT_eX]

[DOI]

Inf. Sci., 2006

Fast LLL-type lattice reduction.

[BibT_eX]

[DOI]

Inf. Comput., 2006

2003

Lattice Reduction by Random Sampling and Birthday Methods.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Cryptanalysis of Two Sparse Polynomial Based Public Key Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2001

Security of Blind Discrete Log Signatures against Interactive Attacks.

[BibT_eX]

[DOI]

Proceedings of the Information and Communications Security, Third International Conference, 2001

Segment LLL-Reduction with Floating Point Orthogonalization.

[BibT_eX]

[DOI]

Henrik Koy

Proceedings of the Cryptography and Lattices, International Conference, 2001

Segment LLL-Reduction of Lattice Bases.

[BibT_eX]

[DOI]

Henrik Koy

Proceedings of the Cryptography and Lattices, International Conference, 2001

2000

Stronger Security Proofs for RSA and Rabin Bits.

[BibT_eX]

[DOI]

Roger Fischlin

J. Cryptol., 2000

Security of Signed ElGamal Encryption.

[BibT_eX]

[DOI]

Markus Jakobsson

Proceedings of the Advances in Cryptology, 2000

1999

Efficient Oblivious Proofs of Correct Exponentiation.

[BibT_eX]

Markus Jakobsson

Proceedings of the Secure Information Networks: Communications and Multimedia Security, 1999

1998

The Black-Box Model for Cryptographic Primitives.

[BibT_eX]

[DOI]

Serge Vaudenay

J. Cryptol., 1998

Almost All Discrete Log Bits Are Simultaneously Secure.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1998

Security of Allmost ALL Discrete Log Bits

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract).

[BibT_eX]

[DOI]

C. R. Subramanian

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1996

The Generalized Gauss Reduction Algorithm.

[BibT_eX]

[DOI]

Michael Kaib

J. Algorithms, 1996

An Optimal, Stable Continued Fraction Algorithm for Arbitrary Dimension

[BibT_eX]

[DOI]

Carsten Rössner

Electron. Colloquium Comput. Complex., 1996

Security of 2t-Root Identification and Signatures

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1996

An Optimal, Stable Continued Fraction Algorithm.

[BibT_eX]

[DOI]

Carsten Rössner

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

Security of 2^t-Root Identification and Signatures.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

1995

Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction

[BibT_eX]

[DOI]

Horst Helmut Hörner

Electron. Colloquium Comput. Complex., 1995

Computation of Highly Regular Nearby Points.

[BibT_eX]

[DOI]

Carsten Rössner

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994

Lattice basis reduction: Improved practical algorithms and solving subset sum problems.

[BibT_eX]

[DOI]

M. Euchner

Math. Program., 1994

Block Reduced Lattice Bases and Successive Minima.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

Black Box Cryptanalysis of Hash Networks Based on Multipermutations.

[BibT_eX]

[DOI]

Serge Vaudenay

Proceedings of the Advances in Cryptology, 1994

1993

Local Randomness in Polynomial Random Number and Random Function Generators.

[BibT_eX]

[DOI]

Harald Niederreiter

SIAM J. Comput., 1993

Parallel FFT-Hashing.

[BibT_eX]

[DOI]

Serge Vaudenay

Proceedings of the Fast Software Encryption, 1993

1992

The Multiplicative Complexity of Quadratic Boolean Forms.

[BibT_eX]

[DOI]

Roland Mirwald

Theor. Comput. Sci., 1992

Improved Low-Density Subset Sum Algorithms.

[BibT_eX]

[DOI]

Comput. Complex., 1992

FFT-Hash II, Efficient Cryptographic Hashing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

Local Randomness in Candidate One-Way Functions.

[BibT_eX]

[DOI]

Harald Niederreiter

Proceedings of the Advances in Cryptology, 1992

Computation of the Boolean Matrix-Vector, AND/OR-Produkt in Average Time O(m + nlnn).

[BibT_eX]

[DOI]

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1991

Efficient Signature Generation by Smart Cards.

[BibT_eX]

[DOI]

J. Cryptol., 1991

Efficient, Perfect Polynomial Random Number Generators.

[BibT_eX]

[DOI]

Silvio Micali

J. Cryptol., 1991

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

An Improved Low-Denisty Subset Sum Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

1990

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

[BibT_eX]

[DOI]

J. C. Lagarias

Hendrik W. Lenstra Jr.

Comb., 1990

Fast Signature Generation With a Fiat Shamir-Like Scheme.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation.

[BibT_eX]

[DOI]

Proceedings of the Advances In Computational Complexity Theory, 1990

1989

Polynomial Time Algorithms for Finding Integer Relations among Real Numbers.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Efficient Identification and Signatures for Smart Cards (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

Efficient Identification and Signatures for Smart Cards.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1988

RSA and Rabin Functions: Certain Parts are as Hard as the Whole.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

A More Efficient Algorithm for Lattice Basis Reduction.

[BibT_eX]

[DOI]

J. Algorithms, 1988

Geometry of Numbers and Integer Programming (Summary).

[BibT_eX]

[DOI]

Proceedings of the STACS 88, 1988

On the Construction of Random Number Generators and Random Function Generators.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

Efficient, Perfect Random Number Generators.

[BibT_eX]

[DOI]

Silvio Micali

Proceedings of the Advances in Cryptology, 1988

The Multiplicative Complexity of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1988

1987

An efficient solution of the congruence x2+ky2=mpmod{n}.

[BibT_eX]

[DOI]

John M. Pollard

IEEE Trans. Inf. Theory, 1987

A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

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

[BibT_eX]

[DOI]

Zvi Galil

Christoph M. Hoffmann

Eugene M. Luks

Andreas Weber

J. ACM, 1987

Approximating Integer Lattices by Lattices with Cyclic Factor Groups.

[BibT_eX]

[DOI]

Azaria Paz

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

A Gödel Theorem on Network Complexity Lower Bounds.

[BibT_eX]

[DOI]

Math. Log. Q., 1986

An Optimal Sorting Algorithm for Mesh Connected Computers

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984

Cryptanalysis of Certain Variants of Rabin's Signature Scheme.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

An Efficient Signature Scheme Based on Quadratic Equations

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

RSA-Bits are 0.5 + epsilon Secure.

[BibT_eX]

[DOI]

Werner Alexi

Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

Efficient Signature Schemes Based on Polynomial Equations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1984

1983

Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel.

[BibT_eX]

[DOI]

Jürgen Sattler

Computing, 1983

Monte-Carlo factoring algorithm with finite storage.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1983

Signatures through Approximate Representation by Quadratic Forms.

[BibT_eX]

Proceedings of the Advances in Cryptology, 1983

1982

Refined Analysis and Improvements on Some Factoring Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1982

An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs

[BibT_eX]

[DOI]

Zvi Galil

Christoph M. Hoffmann

Eugene M. Luks

Andreas Weber

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Is the RSA Scheme Safe?

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jürgen Sattler

Proceedings of the Cryptography, Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, March 29, 1982

1981

An Extension of Strassen's Degree Bound.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

How Many Polynomials can be Approximated Faster Than They can be Evaluated?

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1980

On the Additive Complexity of Polynomials.

[BibT_eX]

[DOI]

Jean-Paul Van de Wiele

Theor. Comput. Sci., 1980

A 3n-Lower Bound on the Network Complexity of Boolean Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Testing Polynomials which Are Easy to Compute (Extended Abstract)

[BibT_eX]

[DOI]

Joos Heintz

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

Bottlenecks and Edge Connectivity in Unsymmetrical Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1979

On the Additive Complexity of Polynomials and some New Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

1978

Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

An Algorithm for Transitive Closure with Linear Expected Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

Satisfiability Is Quasilinear Complete in NQL.

[BibT_eX]

[DOI]

J. ACM, 1978

Multiterminal Network Flow and Connectivity in Unsymmetrical Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1978

1977

General Random Sequences and Learnable Sequences.

[BibT_eX]

[DOI]

P. Fuchs

J. Symb. Log., 1977

A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors.

[BibT_eX]

[DOI]

H. Klupp

Inf. Process. Lett., 1977

An algorithm for stransitive closure with linear expected time.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1977

Über Netzwerkgrößen höherer Ordnung und die mittlere Anzahl der in Netzwerken benutzten Operationen.

[BibT_eX]

[DOI]

C. Reynvaan

Proceedings of the Theoretical Computer Science, 1977

Improved Lower Bounds on the Number of Multiplications/Divisions Which Are Necessary to Evaluate Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976

A Lower Bound on the Number of Additions in Monotone Computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

The Combinational Complexity of Equivalence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

The Network Complexity and the Turing Machine Complexity of Finite Functions.

[BibT_eX]

[DOI]

Acta Informatica, 1976

Optimal Algorithms for Self-Reducible Problems.

[BibT_eX]

Proceedings of the Third International Colloquium on Automata, 1976

1975

Optimal Enumerations and Optimal Gödel Numberings.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1975

A characterization of complexity sequences.

[BibT_eX]

[DOI]

G. Stumpf

Math. Log. Q., 1975

The network-complexity of equivalence and other applications of the network complexity.

[BibT_eX]

[DOI]

Proceedings of the Automata Theory and Formal Languages, 1975

1974

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

[BibT_eX]

[DOI]

Computing, 1974

On Maximal Merging of Information in Boolean Computations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Rekursive Funktionen und ihre Komplexität.

[BibT_eX]

Leitfäden der angewandten Mathematik und Mechanik 24, Teubner, ISBN: 978-3-519-02322-7, 1974

1973

Process Complexity and Effective Random Tests.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1973

Lower Bounds for the Product of Time and Space Requirements of Turing Machine Computations.

[BibT_eX]

Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972

Endliche Automaten und Zufallsfolgen.

[BibT_eX]

[DOI]

H. Stimm

Acta Informatica, 1972

Does the Computational Speed-up Concern Programming?

[BibT_eX]

Proceedings of the Automata, 1972

1971

A Unified Approach to the Definition of Random Sequences.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1971

Optimal Gödel Numberings.

[BibT_eX]

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

Zufälligkeit und Wahrscheinlichkeit - Eine algorithmische Begründung der Wahrscheinlichkeitstheorie.

[BibT_eX]

[DOI]

Lecture Notes in Mathematics 218, Springer, ISBN: 978-3-540-05566-2, 1971

1969

Errata: "Transformational Classes of Grammars"

[BibT_eX]

[DOI]

Inf. Control., August, 1969

Transformational Classes of Grammars

[BibT_eX]

[DOI]

Inf. Control., March, 1969

Pullbackkonstruktionen bei Semi-Thuesystemen.

[BibT_eX]

Hermann K.-G. Walter

J. Inf. Process. Cybern., 1969

1968

Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen.

[BibT_eX]

[DOI]

Computing, 1968

1967

Darstellbarkeit von Sprachen durch freie assoziative Systeme.

[BibT_eX]

[DOI]

PhD thesis, 1967

Freie assoziative Systeme.

[BibT_eX]