- Ein mibrauchfreies anonymes elektronisches Zahlungssystem
- Jintai Ding, Johannes Buchmann, Mohamed Saied Emam Mohamed, Wael Said Abd Elmageed Mohamed and Ralf-Philipp Weinmann
- Zur Berechnung von Klassengruppen Vom Fachbereich Informatik
- Proceedings of Symposia in Applied Mathematics Volume 00, 0000
- Cryptographic protocols Johannes Buchmann
- Public-Key Cryptography Theory and Practice
- Short representation of quadratic integers Johannes Buchmann
- On short representations of orders and number fields
- Rigorously Analyzed Algorithms for the Discrete Logarithm Problem
- Computing the number of points of elliptic over finite fields
- Algorithms for finite abelian groups Johannes Buchmann \Lambda Sachar Paulus y
- Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
- Merkle Signatures with Virtually Unlimited Signature Capacity
- Attacking code/lattice-based cryptosystems using Partial Knowledge
- Ein Algorithmus zur der Klassenzahl
- Approximating rings of integers in number fields version 19940117 Approximating rings of integers in number fields
- On the complexity of some problems in algorithmic algebraic
- Fail-Safe-Konzept f ur Public-Key-Infrastrukturen
- Towards a Flexible Intra-Trustcenter Management Protocol
- Tools for proving zero knowledge Ingrid Biehl
- Basisreduktionsalgorithmen f ur Gitter kleiner Dimension
- On the complexity and efficiency of a new key exchange system
- Zur Effizienz von Elliptische Kurven Kryptographie
- Proceedings of Symposia in Applied Mathematics Volume 00, 0000
- Ein Algorithmus zur Bestimmung der Punktanzahl elliptischer Kurven
- Entwurf und Entwicklung einer objektorientierten Bibliothek f ur algorithmische Zahlentheorie
- Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography
- Faktorisieren mit dem Number Field Sieve
- Integration von Mechanismen zur Unterst utzung der Fehlertoleranz in LiPS
- Zur Trennung von Klassen ununterscheidbarer Ensembles
- Eine Grundlegung der AverageCase Komplexit atstheorie
- Regulator approximation and fundamental unit computation for
- Efficient Hash-Based Signatures on Embedded Devices
- Fail-Safe-Konzept fur Public-Key-Infrastrukturen
- Computing a reduced lattice basis from a generating system
- Intrinsically Legal-For-Trade Objects by Digital Signatures A. Wiesmaier
- kryptographischer Dissertation
- Cryptographic Protocols Based on Discrete Logarithms in Realquadratic Orders
- A system for distributed applications Johannes Buchmann
- Distributed class group computation Johannes Buchmann
- Efficiency Improvement for NTRU Johannes Buchmann Martin Dring
- An implementation of the general number field sieve J. Buchmann J. Loho J. Zayer
- On the Computation of Discrete Logarithms
- Towards Secure Electronic Workflows Sebastian Fritsch, Vangelis Karatsiolis, Marcus Lippert,
- Merkle tree traversal revisited Johannes Buchmann, Erik Dahmen, and Michael Schneider
- A subexponential algorithm for the determination of class groups and regulators of
- On smooth ideals in number fields Johannes A. Buchmann, Christine S. Hollinger \Lambda
- On lower bounds for Information Set Decoding over Fq Robert Niebuhr1
- Explicit hard instances of the shortest vector problem
- Codes and Lattices in Cryptography Code-based systems belong to the most promising candidates for post-quantum
- Book Editors IOS Press, 2003
- Computer Verification in Cryptography Markus Kaiser, Johannes Buchmann
- Towards a Flexible Intra-Trustcenter Management Protocol
- Secure Roaming and Handover Procedures in Wireless Access Networks
- Fairer Austausch Vom Fachbereich Informatik
- Uber die Sicherheit und Effizienz kryptographischer Verfahren mit Klassengruppen imaginar-quadratischer Zahlkorper
- New public-key cryptosystems with fast decryption
- Losen gro er dunnbesetzter Gleichungssysteme uber endlichen
- Johannes A. Buchmann Corrections to "Introduction to
- Johannes Buchmann Korrekturen zu "Einfuhrung
- Number theoretic algorithms and Johannes Buchmann
- Reducing Lattice Bases by Means of Approximations
