| Publication | Date of Publication | Type |
|---|
An optimal, stable continued fraction algorithm for arbitrary dimension
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Security of 2t-root identification and signatures
Advances in Cryptology — CRYPTO ’96 | 2015-11-11 | Paper |
Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers
SIAM Journal on Computing | 2014-06-04 | Paper |
Factoring integers by CVP algorithms
Lecture Notes in Computer Science | 2013-12-10 | Paper |
Progress on LLL and lattice reduction
The LLL Algorithm | 2010-03-05 | Paper |
Identification and signatures based on NP-hard problems of indefinite quadratic forms
Journal of Mathematical Cryptology | 2009-03-03 | Paper |
Public Key Identification Based on the Equivalence of Quadratic Forms
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Enhancing the security of perfect blind DL-signatures
Information Sciences | 2006-05-16 | Paper |
Fast LLL-type lattice reduction
Information and Computation | 2006-04-28 | Paper |
| scientific article; zbMATH DE number 2080670 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1962809 (Why is no real title available?) | 2003-08-11 | Paper |
| scientific article; zbMATH DE number 1852137 (Why is no real title available?) | 2003-01-09 | Paper |
| scientific article; zbMATH DE number 1852138 (Why is no real title available?) | 2003-01-09 | Paper |
| scientific article; zbMATH DE number 1618046 (Why is no real title available?) | 2002-07-16 | Paper |
Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
Information Processing Letters | 2002-07-14 | Paper |
| Security of DL-encryption and signatures against generic attacks -- a survey | 2002-06-23 | Paper |
| scientific article; zbMATH DE number 1583771 (Why is no real title available?) | 2002-03-06 | Paper |
| scientific article; zbMATH DE number 1676629 (Why is no real title available?) | 2001-11-25 | Paper |
| scientific article; zbMATH DE number 1498329 (Why is no real title available?) | 2000-08-30 | Paper |
Stronger security proofs for RSA and Rabin bits.
Journal of Cryptology | 2000-01-01 | Paper |
The black-box model for cryptographic primitives
Journal of Cryptology | 1999-10-25 | Paper |
| scientific article; zbMATH DE number 1346524 (Why is no real title available?) | 1999-10-03 | Paper |
| scientific article; zbMATH DE number 1088902 (Why is no real title available?) | 1997-12-14 | Paper |
The Generalized Gauss Reduction Algorithm
Journal of Algorithms | 1997-11-18 | Paper |
Block Reduced Lattice Bases and Successive Minima
Combinatorics, Probability and Computing | 1995-03-30 | Paper |
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Mathematical Programming. Series A. Series B | 1994-12-11 | Paper |
| scientific article; zbMATH DE number 549859 (Why is no real title available?) | 1994-07-21 | Paper |
| scientific article; zbMATH DE number 503354 (Why is no real title available?) | 1994-06-12 | Paper |
| scientific article; zbMATH DE number 503326 (Why is no real title available?) | 1994-02-22 | Paper |
Local Randomness in Polynomial Random Number and Random Function Generators
SIAM Journal on Computing | 1993-10-10 | Paper |
| scientific article; zbMATH DE number 176872 (Why is no real title available?) | 1993-05-18 | Paper |
An Improved Low-Density Subset Sum Algorithm
Advances in Cryptology — EUROCRYPT ’91 | 1993-05-18 | Paper |
Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
Advances in Cryptology — EUROCRYPT ’91 | 1993-05-18 | Paper |
Improved low-density subset sum algorithms
Computational Complexity | 1993-04-01 | Paper |
The multiplicative complexity of quadratic boolean forms
Theoretical Computer Science | 1993-01-16 | Paper |
Efficient signature generation by smart cards
Journal of Cryptology | 1992-06-27 | Paper |
A more efficient algorithm for lattice basis reduction
Journal of Algorithms | 1992-06-25 | Paper |
Efficient, perfect polynomial random number generators
Journal of Cryptology | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4191111 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4182680 (Why is no real title available?) | 1990-01-01 | Paper |
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
Combinatorica | 1990-01-01 | Paper |
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4108153 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4051349 (Why is no real title available?) | 1988-01-01 | Paper |
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4065121 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4084824 (Why is no real title available?) | 1988-01-01 | Paper |
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science | 1987-01-01 | Paper |
An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
A Gödel Theorem on Network Complexity Lower Bounds
Mathematical Logic Quarterly | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3958726 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3980478 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4029654 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3949712 (Why is no real title available?) | 1985-01-01 | Paper |
RSA-bits are 0.5 + ε secure
Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4069911 (Why is no real title available?) | 1985-01-01 | Paper |
| A Monte Carlo Factoring Algorithm With Linear Storage | 1984-01-01 | Paper |
Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel
Computing | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3846867 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3791606 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3799013 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3759547 (Why is no real title available?) | 1982-01-01 | Paper |
Refined analysis and improvements on some factoring algorithms
Journal of Algorithms | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3803522 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3803523 (Why is no real title available?) | 1982-01-01 | Paper |
How many polynomials can be approximated faster than they can be evaluated?
Information Processing Letters | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3878363 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3878364 (Why is no real title available?) | 1981-01-01 | Paper |
On self-transformable combinatorial problems
Mathematical Programming Studies | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3737021 (Why is no real title available?) | 1981-01-01 | Paper |
An Extension of Strassen’s Degree Bound
SIAM Journal on Computing | 1981-01-01 | Paper |
A 3n-lower bound on the network complexity of Boolean functions
Theoretical Computer Science | 1980-01-01 | Paper |
On the additive complexity of polynomials
Theoretical Computer Science | 1980-01-01 | Paper |
Bottlenecks and Edge Connectivity in Unsymmetrical Networks
SIAM Journal on Computing | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3681900 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3698386 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3630218 (Why is no real title available?) | 1979-01-01 | Paper |
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
Theoretical Computer Science | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3646615 (Why is no real title available?) | 1978-01-01 | Paper |
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM | 1978-01-01 | Paper |
General random sequences and learnable sequences
Journal of Symbolic Logic | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3594951 (Why is no real title available?) | 1978-01-01 | Paper |
A universally hard set of formulae with respect to non-deterministic Turing acceptors
Information Processing Letters | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3651752 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3555467 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3560732 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3601541 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3635380 (Why is no real title available?) | 1977-01-01 | Paper |
The combinational complexity of equivalence
Theoretical Computer Science | 1976-01-01 | Paper |
The network complexity and the Turing machine complexity of finite functions
Acta Informatica | 1976-01-01 | Paper |
A lower bound on the number of additions in monotone computations
Theoretical Computer Science | 1976-01-01 | Paper |
A characterization of complexity sequences
Mathematical Logic Quarterly | 1975-01-01 | Paper |
Optimal enumerations and optimal gödel numberings
Mathematical Systems Theory | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3541935 (Why is no real title available?) | 1975-01-01 | Paper |
Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
Computing | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3457862 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3468805 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3446404 (Why is no real title available?) | 1974-01-01 | Paper |
Process complexity and effective random tests
Journal of Computer and System Sciences | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3416961 (Why is no real title available?) | 1973-01-01 | Paper |
