| Publication | Date of Publication | Type |
|---|
| An optimal, stable continued fraction algorithm for arbitrary dimension | 2019-01-11 | Paper |
| Security of 2t-Root Identification and Signatures | 2015-11-11 | Paper |
| Erratum: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers | 2014-06-04 | Paper |
| Factoring Integers by CVP Algorithms | 2013-12-10 | Paper |
| Progress on LLL and Lattice Reduction | 2010-03-05 | Paper |
| Identification and signatures based on NP-hard problems of indefinite quadratic forms | 2009-03-03 | Paper |
| Public Key Identification Based on the Equivalence of Quadratic Forms | 2008-09-17 | Paper |
| Enhancing the security of perfect blind DL-signatures | 2006-05-16 | Paper |
| Fast LLL-type lattice reduction | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473566 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418644 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787200 | 2003-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4787201 | 2003-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2724591 | 2002-07-16 | Paper |
| Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2765015 | 2002-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707405 | 2002-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757225 | 2001-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499405 | 2000-08-30 | Paper |
| Stronger security proofs for RSA and Rabin bits. | 2000-01-01 | Paper |
| The black-box model for cryptographic primitives | 1999-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266548 | 1999-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365727 | 1997-12-14 | Paper |
| The Generalized Gauss Reduction Algorithm | 1997-11-18 | Paper |
| Block Reduced Lattice Bases and Successive Minima | 1995-03-30 | Paper |
| Lattice basis reduction: Improved practical algorithms and solving subset sum problems | 1994-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287363 | 1994-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279693 | 1994-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279660 | 1994-02-22 | Paper |
| Local Randomness in Polynomial Random Number and Random Function Generators | 1993-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036703 | 1993-05-18 | Paper |
| An Improved Low-Density Subset Sum Algorithm | 1993-05-18 | Paper |
| Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation | 1993-05-18 | Paper |
| Improved low-density subset sum algorithms | 1993-04-01 | Paper |
| The multiplicative complexity of quadratic boolean forms | 1993-01-16 | Paper |
| Efficient signature generation by smart cards | 1992-06-27 | Paper |
| A more efficient algorithm for lattice basis reduction | 1992-06-25 | Paper |
| Efficient, perfect polynomial random number generators | 1991-01-01 | Paper |
| Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210171 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5748797 | 1990-01-01 | Paper |
| Polynomial Time Algorithms for Finding Integer Relations among Real Numbers | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832047 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787790 | 1988-01-01 | Paper |
| RSA and Rabin Functions: Certain Parts are as Hard as the Whole | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798759 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813126 | 1988-01-01 | Paper |
| A hierarchy of polynomial time lattice basis reduction algorithms | 1987-01-01 | Paper |
| An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex> | 1987-01-01 | Paper |
| A Gödel Theorem on Network Complexity Lower Bounds | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727379 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745271 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3770590 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3719830 | 1985-01-01 | Paper |
| RSA-bits are 0.5 + ε secure | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802307 | 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 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3316588 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3968459 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4743735 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3942397 | 1982-01-01 | Paper |
| Refined analysis and improvements on some factoring algorithms | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4748203 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4748204 | 1982-01-01 | Paper |
| How many polynomials can be approximated faster than they can be evaluated? | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343442 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343443 | 1981-01-01 | Paper |
| On self-transformable combinatorial problems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3923595 | 1981-01-01 | Paper |
| An Extension of Strassen’s Degree Bound | 1981-01-01 | Paper |
| A 3n-lower bound on the network complexity of Boolean functions | 1980-01-01 | Paper |
| On the additive complexity of polynomials | 1980-01-01 | Paper |
| Bottlenecks and Edge Connectivity in Unsymmetrical Networks | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3877785 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3891769 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4191604 | 1979-01-01 | Paper |
| Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3204983 | 1978-01-01 | Paper |
| Satisfiability Is Quasilinear Complete in NQL | 1978-01-01 | Paper |
| General random sequences and learnable sequences | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160704 | 1978-01-01 | Paper |
| A universally hard set of formulae with respect to non-deterministic Turing acceptors | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3851624 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4128012 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131644 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4168885 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195839 | 1977-01-01 | Paper |
| The combinational complexity of equivalence | 1976-01-01 | Paper |
| The network complexity and the Turing machine complexity of finite functions | 1976-01-01 | Paper |
| A lower bound on the number of additions in monotone computations | 1976-01-01 | Paper |
| A characterization of complexity sequences | 1975-01-01 | Paper |
| Optimal enumerations and optimal gödel numberings | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4117379 | 1975-01-01 | Paper |
| Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4043824 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4053629 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4770473 | 1974-01-01 | Paper |
| Process complexity and effective random tests | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5680997 | 1973-01-01 | Paper |
| Endliche Automaten und Zufallsfolgen | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133126 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5668458 | 1972-01-01 | Paper |
| Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory) | 1971-01-01 | Paper |
| Komplexität von Algorithmen mit Anwendung auf die Analysis | 1971-01-01 | Paper |
| A unified approach to the definition of random sequences | 1971-01-01 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:5587565 Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung] | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5616138 | 1970-01-01 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:5617399 �ber die Definition von effektiven Zufallstests] | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5623666 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5569111 | 1969-01-01 | Paper |
| Transformational classes of grammars | 1969-01-01 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:5581622 Eine Bemerkung zum Begriff der zuf�lligen Folge] | 1969-01-01 | Paper |
| Vier Entscheidbarkeitsprobleme für kontextsensitive Sprachen | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5570938 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5551472 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5554984 | 1967-01-01 | Paper |
