Veröffentlichugen, nach Autoren sortiert

Arbeitsgruppe Johannes Buchmann

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

Thomas Abbé
Implementierung eines qualifiziert signierenden Timestamping-Servers
Diplomarbeit, 01. März 2007

Christine Abel, früher Hollinger
Ein Algorithmus zur Berechnung der Klassenzahl und des Regulators reellquadratischer Ordnungen
(Dissertation 1994)

Toru Akishita, Tsuyoshi Takagi
Zero-Value Point Attacks on Elliptic Curve Cryptosystem (ps,pdf)
Technical Report No. TI-1/03, 19.02.2003 (revised version to appear at ISC 2003)

Sidi Mohamed El yousfi Alaoui
Konstruktion von Hashfunktionen
Diplomarbeit, Oktober 2007

Michael Albert
Konzeption und Implementierung eines Remote Access VPNs für Außendienstarbeiter unter Einsatz einer Public-Key-Infrastruktur
(Diplomarbeit 31.03.2001)

Sandro Amendola
Effiziente Algorithmen für Probleme in Gittern über \R^d
(Diplomarbeit 1995)

Lucie Langer, Axel Schmidt, and Roberto Araújo
A pervasively verifiable online voting scheme
To appear in the proceedings of the Informatik 2008 conference, September 2008

Roberto Araújo, Peter Y. A. Ryan
Improving Farnel, Threeballot and Randell-Ryan Voting Schemes
Technical Report No 1069 - School of Computing Science,
Newcastle University, Feb 2008
eprint

Roberto Araújo, Sébastian Foulle, Jacques Traoré
A practical and secure coercion-resistant scheme for remote elections
In: Frontiers of Electronic Voting - 2007

Stefan Georg Weber , Roberto Araújo, Johannes Buchmann
On Coercion-Resistant Electronic Elections with Linear Work
In: 2nd Workshop on Dependability and Security in e-Government (DeSeGov 2007)
at 2nd Int. Conference on Availability, Reliability and Security (ARES´07)
pp. 908-916, iee, 2007. ISBN 0-7695-2775-2.

J. Frommer, A. Wiesmaier, R. Araújo, and M. Lippert
On Firewalls and Tunneling
In "4th International Conference on Applied Cryptography and Network Security (ACNS´06)"
June 2006 (appeared)
lokale Version

U. Steinhoff , A. Wiesmaier, R. Araújo, and M. Lippert
The State of the Art in DNS Spoofing
In "4th International Conference on Applied Cryptography and Network Security (ACNS´06)"
June 2006 (appeared)
lokale Version

D. grosse Osterhues, A. Wiesmaier, R. Araújo, and M. Lippert
On Securing Unix Systems with Smart Cards
In "4th International Conference on Applied Cryptography and Network Security (ACNS´06)"
June 2006 (appeared)
lokale Version

Werner Backes
Berechnung kürzester Gittervektoren
(Diplomarbeit 1998)

Werner Backes, Patrick Theobald, Susanne Wetzel
Design Concepts for Matrices and Lattices in LiDIA
Technical Report No. TI-4/96, 02.10.1996

H. Baier, T. Straub
Awareness by Doing . Ein neues Konzept zur Sensibilisierung von IT-Anwendern. Proc
BSI-Kongress, Bundesamt für Sicherheit in der Informationstechnik, Bonn, 2005.

Harald Baier, Markus Ruppert
Interoperable and Flexible Digital Signatures for E-Government and E-Commerce
Technical Report No. TI-6/04, 13.05.2004

Tobias Straub, Harald Baier
A Framework for Evaluating the Usability and the Utility of PKI-enabled Applications
Technical Report No. TI-5/04, 13.05.2004

Harald Baier
A Fast Java Implementation of a Provably Secure Pseudo Random Bit Generator Based on the Elliptic Curve Discrete Logarithm Problem
Technical Report No. TI-7/03, 01.12.2003

Harald Baier, Günter Köhler
How to Compute the Coefficients of the Elliptic Modular Function j(z)
Technical Report No. TI-4/03, 21.05.2003

Harald Baier, Johannes Buchmann, Christoph Busch
Aus- und Weiterbildung in IT-Sicherheit
Technical Report No. TI-2/03, 19.02.2003

Harald Baier
Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography
(Dissertation, 07.05.2002)

Harald Baier
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
Technical Report No. TI-11/01, 02.10.2001

Harald Baier
Efficient Computation of Fourier Series and Singular Moduli with Application in Cryptography
Technical Report No. TI-7/01, 19.04.2001

Harald Baier, Johannes Buchmann
Efficient Construction of Cryptographically Strong Elliptic Curves
Technical Report No. TI-2/01, 01.03.2001

Harini Bakuri
Security Analysis and Implementation of Password-based Cryptosystem
Diplomarbeit, Januar 2005

Nima Barraci, Sven Becker
Generische Integration von Kryptoprozessoren in den Java-basierten FlexiProvider
Studienarbeit, SS2003

Jutta Bartholomes
Gitterbasisreduktion im Reellen
(Diplomarbeit 1993)

Anja Becker
Methods of Fault Analysis Attacks on Elliptic Curve Cryptosystems
Diplomarbeit, September 2006

Jochen Becker
Kommunikation in einem Trustcenter
Intra Trustcenter Protocol Version 1.2 Entwurf und Design
Diplomarbeit, 20.07.2007

Younes Bennani
Optimierung de Flexsecures Online Certificate Status Protocol
Diplomarbeit, 12.07.2007

Patrik Bentz
Eine effiziente Implementierung der verbesserten Buchberger Algorithmen und eine Datenstruktur für Polynome in mehreren Veränderlichen
(Diplomarbeit 1995)

Franz-Dieter Berger
ECM - Faktorisieren mit elliptischen Kurven
(Diplomarbeit 1993)

Martin Bergner
Minimale Voraussetzungen für blinde Signaturen
Bachelorarbeit, April 2008

Adalbert Biadatz
Server gesteuerte Chipkarten Aktualisierung
Diplomarbeit, Juni 2008

Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
A Signature Scheme Based on the Intractability of Computing Roots
Technical Report No. TI-1/00, 22.02.2000 - updated: 15.06.2000

Helo Appel, Ingrid Biehl, Arnulf Fuhrmann, Markus Ruppert, Tsuyoshi Takagi,
Akira Takura, Christian Valentin
Ein sicherer, robuster Zeitstempeldienst auf der Basis verteilter RSA-Signaturen
Technical Report No. TI-21/99, 16.12. 1999

Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
Cryptographic Protocols Based on Intractability of Extracting Roots and Computing Discrete Logarithms
Technical Report No. TI-16/99, 10.11.1999

Ingrid Biehl, Sachar Paulus, Tsuyoshi Takagi
Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders
Technical Report No. TI-10/99, 18.05.1999

Ingrid Biehl, Johannes Buchmann
An analysis of the reduction algorithms for binary quadratic forms
Technical Report No. TI-26/97, 07.11.1997

Ingrid Biehl, Susanne Wetzel
Traceable Visual Cryptography
Technical Report No. TI-10/97, 28.04.1997

Ingrid Biehl, Bernd Meyer
Protocols for Collusion-Secure Asymmetric Fingerprintig
Technical Report No. TI-1/96, 16.07.1996

Ingrid Biehl
Definition and Existence of Super Complexity Cores
(ISAAC´94)

Biehl, Buchmann, Thiel
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic orders
(CRYPTO94)

Ingrid Biehl, Johannes Buchmann
Algorithms for quadratic orders
(Mathematics of Computation 1943-1993 (1994))

Ingrid Biehl
Eine Grundlegung der Average-Case Komplexitätstheorie
(Dissertation 1993)

Ingrid Biehl, Johannes Buchmann
Algorithms for quadratic orders
( submitted to Vancouver 1993 ?)

Buchmann, Biehl, Meyer, Thiel, Thiel
Tools for proving zero knowledge
(EuroCrypt 1992)

Emre Binisik
Sieben in Zahlkörpern und Funktionenkörpern
(Diplomarbeit 19.05.1999)

Sebastian Blume
Efficient Java Implementation of GMSS
Diplomarbeit, 06.08.2007

Michele Boivin
Anwendung hyperelliptischer Kurven in der Kryptographie
(Diplomarbeit 1999)

Zornitsa Borisova
Rankin Lattice Reduction for Programmers
Bachelorarbeit, September 2007

Manuel Breuning
Eine topologische Struktur für die Idealgruppe
(Diplomarbeit 1999)

Johannes Buchmann, Richard Lindner, Markus Rückert
Explicit hard instances of the shortest vector problem

Jintai Ding, Johannes Buchmann, Mohamed Saied Emam Mohamed, Wael Said Abd Elmageed Mohamed and Ralf-Philipp Weinmann
MutantXL
In Proceedings of the SCC 2008

Sebastian Rohde, Thomas Eisenbarth, Erik Dahmen, Johannes Buchmann, Christof Paar
Efficient Hash-Based Signatures on Embedded Devices
SECSI - Secure Component and System Identification, 2008

Sebastian Rohde, Thomas Eisenbarth, Erik Dahmen, Johannes Buchmann, Christof Paar
Fast Hash-Based Signatures on Constrained Devices
Eighth Smart Card Research and Advanced Application Conference - CARDIS, to appear, 2008

Johannes Buchmann, Erik Dahmen, Michael Schneider
Merkle tree traversal revisited
2nd International Workshop on Post-Quantum Cryptography - PQCrypto 2008, to appear

Johannes Buchmann, Martin Döring, Richard Lindner
Efficiency Improvement for NTRU
Sicherheit 2008, 2.-4. April 2008, Saarbrücken

Lucie Langer, Axel Schmidt, Johannes Buchmann
Secure Online Elections in Practice
Cryptology eprint Archive, Report 2008/157, April 2008

Stefan Georg Weber , Roberto Araujo, Johannes Buchmann
On Coercion-Resistant Electronic Elections with Linear Work
In: 2nd Workshop on Dependability and Security in e-Government (DeSeGov 2007)
at 2nd Int. Conference on Availability, Reliability and Security (ARES´07)
pp. 908-916, iee, 2007. ISBN 0-7695-2775-2.

Organizers: Johannes Buchmann, Alexander May, Ulrich Vollmer
CLC2006 - Workshop on Codes and Lattices in Cryptography
CLC2006 Preproceedings
25.-27. September 2006

J. Buchmann, E. Dahmen, A. May, U. Vollmer
Krypto 2020
KES - The Information Security Journal, Nr 5, 2006

Johannes Buchmann, Alexander May, Ulrich Vollmer
"Perspectives for Cryptographic Long-Term Security"
Communications of the ACM, Vol. 49(9), 50-56, 2006

Johannes Buchmann, Ulrich Vollmer
Binary Quadratic Forms
An Algorithmic Approach
Springer Verlag
Series: Algorithms and Computation in Mathematics, Vol. 20
ISBN: 978-3-540-46367-2

J. Buchmann, E.Dahmen, E. Klintsevich, K. Okeya, C.Vuillaume, Merkle Signatures with Virtually Unlimited Signature Capacity, 5th International Conference on Applied Cryptography and Network Security - ACNS´07,
LNCS 4521, Springer, 2007, pp. 31-45.
(lokaler link)

Johannes Buchmann, Andrei Pyshkin, Ralf-Philipp Weinmann
A Zero-Dimensional Groebner Basis for AES-128
FSE 2006, LNCS 4047, pp. 78-88, Springer-Verlag, [pdf available through SpringerLink]

Johannes Buchmann, Andrei Pyshkin, Ralf-Philipp Weinmann
Block Ciphers Sensitive to Groebner Basis Attacks
CT-RSA 2006, LNCS 3860, pp. 313-331, Springer-Verlag, [pdf available through SpringerLink]

J. Buchmann, L.C. Coronado García, E. Dahmen, M. Döring, E. Klintsevich
CMSS -- An Improved Merkle Signature Scheme
Progress in Cryptology - Indocrypt 2006, LNCS 4329, pp. 349-363, Springer, 2006.
CMSS -- An Improved Merkle Signature Scheme (local version)

Johannes Buchmann
Passwörter oder Smartcards zur Absicherung von Portalen?
Technical Report No. TI-2/06, Oktober 2006

M. Lippert, V. Karatsiolis, A. Wiesmaier, J. Buchmann
Lifecycle management of X.509 certificates based on LDAP directories
Journal of Computer Security, 14(5):419-439, September 2006

S. Fritsch, V. Karatsiolis, M. Lippert, A. Wiesmaier, J. Buchmann
Towards Secure Electronic Workflows
In Proceedings of Public Key Infrastructure: Third European PKI Workshop: Theory and Practice, EuroPKI 2006, LNCS volume 4043, pages 154-168, June 2006

J. Buchmann, M. Kaiser
Computer Proven Correctness of the Rabin Public-Key Scheme
Proceedings of World Academy of Science, Engineering and Technology
Volume 21, May 25-27, 2007, Vienna, Austria
ISSN: 1307-6884 ISBN: 978-975-01752-0-6

Markus Kaiser, Johannes Buchmann
A Formal Approach for Proof Constructions in Cryptography
in International Journal of Computer Science(IJCS), Volume 1:2006,
ISSN 1306-4428

Markus Kaiser, Johannes Buchmann
Computer Verification in Cryptography
in Proceedings ICCS´06 Vienna, Austria, Volume 12,
March 29-31, 2006, ISBN 975-00803-1-9

U. Rauchschwalbe, A. Wiesmaier, C. Ludwig, and J. Buchmann
Digital Signierte Wägeresultate - Neue Wege in der Sicherung eichfähiger Messwerte
erschienen in "WDM - Wägen, Dosieren, Mischen", Ausgabe 3/2006 (Mai 2006), 23 - 27; Verlag Coating Thomas & Co.
lokale Version

A. Wiesmaier, U. Rauchschwalbe, C. Ludwig, M. Ruppert, and J. Buchmann
Intrinsically Legal-For-Trade Objects by Digital Signatures
(local version)
in "Proceedings of Sicherheit 2006"
February 2006

Christina Lindenberg, Kai Wirt, Johannes Buchmann
Formal Proof for the Correctness of RSA-PSS
Cryptology ePrint Archive, Report 2006/011, http://eprint.iacr.org/2006/011

T. Straub, T.-A. Ginkel, J. Buchmann
A Multipurpose Delegation Proxy for WWW Credentials
Proc. 2nd European PKI Workshop, Canterbury, Springer LNCS 3545, 2005

M. Lippert, V. Karatsiolis, A. Wiesmaier, J. Buchmann
Directory Based Registration in Public Key Infrastructures
In the 4th International Workshop for Applied PKI, IWAP 2005, pages 17-32, September 2005

A. Wiesmaier, E. Karatsiolis, M. Lippert, J. Buchmann
The Workshop -- Implementing Well Structured Enterprise Applications
in Proceedings of "The 2005 International Conference on Software Engineering Research and Practice (SERP´05)"
June 2005

A. Wiesmaier, M. Lippert, E. Karatsiolis, G. Raptis, J. Buchmann
An Evaluated Certification Services System for the German National Root CA -- Legally binding and trustworthy Transactions in E-Business and E-Government
in Proceedings of "The 2005 International Conference on e-Business, Enterprise Information Systems, e-Government, and Outsourcing (EEE´05)"
June 2005

A. Wiesmaier, M. Fischer, M. Lippert, J. Buchmann
Outflanking and securely using the PIN/TAN-System
in Proceedings of "The 2005 International Conference on Security and Management (SAM´05)"
June 2005

Johannes Buchmann, Christoph Ludwig
Practical Lattice Basis Sampling Reduction
Cryptology ePrint Archive

J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmer, R. Weinmann
Post-Quantum Signatures (link)
Oktober 2004

Vangelis Karatsiolis, Marcus Lippert, Alexander Wiesmaier, Anna Pitaev, Markus Ruppert, Johannes Buchmann
Towards a Flexible Intra-Trustcenter Management Protocol (ps.gz, pdf)
in The Third International Workshop for Applied PKI (IWAP2004)

J. Buchmann
Einführung in die Kryptographie,
3., durchges. u. erw. Aufl., Springer-Verlag, 2004, 266p.

Johannes Buchmann, Tsuyoshi Takagi, Ulrich Vollmer
Number Field Cryptography
IN: High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, volume 41, pages 111-125, 2004
local version: Technical Report No. TI-11/03

Johannes Buchmann, Tsuyoshi Takagi
Kryptographie - Chancen und Risiken
Technical Report No. TI-6/03, 18.11.2003

Johannes Buchmann, Arthur Schmidt
Computing the structure of a finite abelian group
Technical Report No. TI-5/03, 12.06.2003

Harald Baier, Johannes Buchmann, Christoph Busch
Aus- und Weiterbildung in IT-Sicherheit
Technical Report No. TI-2/03, 19.02.2003

J. Buchmann
Cryptographic Protocols
Vorlesungsskript
(u.a. Undeniable, Fail-Stop und Blind Signatures)

Johannes Buchmann, Kouichi Sakurai, Tsuyoshi Takagi
An IND-CCA2 Public-Key Cryptosystem with Fast Decryption
Technical Report No. TI-10/01, 06.09.2001

Johannes Buchmann
Wie sicher kann Sicherheit sein?
Technical Report No. TI-5/01, 28.03.2001

Johannes Buchmann, Safuat Hamdy
A Survey on IQ Cryptography
Technical Report No. TI-4/01, 21.03.2001

Harald Baier, Johannes Buchmann
Efficient Construction of Cryptographically Strong Elliptic Curves
Technical Report No. TI-2/01, 01.03.2001

Johannes Buchmann, Markus Maurer, Bodo Möller
Cryptography Based on Number Fields with Large Regulator
Technical Report No. TI-5/00, 06.06.2000

Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
A Signature Scheme Based on the Intractability of Computing Roots
Technical Report No. TI-1/00, 22.02.2000 - updated: 15.06.2000

Johannes Buchmann, Markus Ruppert, Markus Tak
FlexiPKI - Realisierung einer flexiblen Public-Key-Infrastruktur
Technical Report No. TI-22/99, 16.12.1999

Johannes Buchmann, Douglas Squirrel
Kernels of Integer Matrices via Modular Arithmetic
Technical Report No. TI-4/99, 04.02.1999

Johannes Buchmann, Markus Maurer
Wie sicher ist die Public-Key-Kryptographie?
Technical Report No. TI-2/99, 28.01.1999

Johannes Buchmann, Damian Weber
Discrete Logarithms: Recent Progress
Technical Report No. TI-12/98, 26.11.1998

Johannes Buchmann, Michael J. Jacobson, Stefan Neis, Patrick Theobald, Damian Weber
Sieving Methods for Class Group Computation
Technical Report No. TI-8/98, 01.10.1998

Johannes Buchmann, Markus Maurer
Approximate Evaluation of L(1,chi-delta)
Technical Report No. TI-6/98, 16.04.1998

Ingrid Biehl, Johannes Buchmann
An analysis of the reduction algorithms for binary quadratic forms
Technical Report No. TI-26/97, 07.11.1997

Johannes Buchmann, Sachar Paulus
A one way function based on ideal arithmetic in number fields Technical Report No. TI-5/97

Johannes Buchmann, Stefan Neis
Algorithms for Linear Algebra Problems over Principal Ideal Rings
Technical Report No. TI-7/96, 28.11.1996

Johannes Buchmann, Friedrich Eisenbrand
On Factor Refinement in Number Fields
Technical Report No. TI-5/96

Johannes Buchmann, Michael Jacobson, Edlyn Teske
On some computational problems in finite abelian groups
Technical Report No. TI-2/96, 17.07.1996,
appear in Mathematics of Computation 1996

J. Buchmann, M. Jacobson jr., E. Teske
On some computational problems in finite abelian groups
(to appear in to Mathematics of Computation 1996)

J. Buchmann, H.W. Lenstra jr.
Approximating rings of integers in number fields
(submitted to Seminaire de Theorie des Nombres Bordeaux)

Biehl, Buchmann, Thiel
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic orders
(CRYPTO94)

Ingrid Biehl, Johannes Buchmann
Algorithms for quadratic orders
(Mathematics of Computation 1943-1993 (1994))

Johannes Buchmann
Reducing lattice bases by means of approximations
(Proceedings of ANTS I (1994))

Ingrid Biehl, Johannes Buchmann
Algorithms for quadratic orders
( submitted to Vancouver 1993 ?)

Johannes Buchmann, Christine Hollinger
On smooth ideals in number fields
(submitted to Journal of Number Theory, 1993)

J. Buchmann, J. Loho, J. Zayer
An implementation of the general number field sieve
(Crypto 1993)

Johannes Buchmann, Sachar Paulus
Algorithms for finite abelian groups
(submitted to Moscow 1993)

Buchmann, Biehl, Meyer, Thiel, Thiel
Tools for proving zero knowledge
(EuroCrypt 1992)

Johannes Buchmann, Volker Kessler
Computing a reduced lattice basis from a generating system
(unpublished, 1992)

Johannes Buchmann, Oliver van Sprang
On short representations of orders and number fields
(unpublished, 1992)

Buchmann, Chr.Thiel, Williams S
hort representations of quadratic integers
(CANT 1992)

Johannes Buchmann
Number theoretic algorithms and cryptology
(Fundamentals of Computation Theory Proceedings 1991)

Johannes Buchmann, Stephan Düllmann
Distributed class group computation
(Festschrift 60. Geburtstag Prof. Hotz 1991)

Johannes Buchmann, Volker Müller
Computing the number of points on elliptic curves over finite prime fields
(ISSAC 1991)

Johannes Buchmann, Ralf Roth, Matthias Diehl
LiPS: A System for distributed applications
(unpublished 1991)

Johannes Buchmann
A subexponential algorithm for the determination of class groups and regulators of algebraic number fields
(Birkhaeuser 1990)

Johannes Buchmann, Stephan Düllmann
On the computation of discrete logarithms in class groups
(Crypto 1990)

Johannes Buchmann, Victor Shoup
Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis
(unpublished, 1990)

Johannes Buchmann, H.C. Williams
Some remarks concerning the complexity of computing class groups of quadratic fields
(Journal of Complexity 7, 1989)

Buchmann, Düllmann, Williams
On the complexity and efficiency of a new key exchange system
(EuroCrypt 1989)

Michael Budnick
Zur Reduktion des DL-Problems für elliptische Kurven auf das DL-Problem in endlichen Körpern
(Diplomarbeit 30.03.1999)

Robert Carls
Punktezählalgorithmen für ordinäre elliptische Kurven über endlichen Körpern der Charakteristik 2
(Diplomarbeit, 21.09.1999)

Jan Caspary, Martin Weber
Hardwarebeschleunigung der Punktmultiplikation über GF(2^n) mit dem Elliptic Curve KryptoProzessor (ECP) am Beispiel des ECDSA-Signaturverfahrens
(Studienarbeit Juni 2001)

Jun Chen
Verifiable Mixnets Techniques and Prototype Implementation
Diplomarbeit, März 2007

Johannes Clos
Secure Client Platforms for Remote Internet Voting
Diplomarbeit, Februar 2008

Vlad Coroama
Flexible Anbindung von SmartCards an eine Java-Sicherheitsinfrastruktur
(Diplomarbeit, 31.03.2000)

Vlad Coroama, Markus Ruppert, Michael Seipel, Markus Tak
Java-basierte Kryptographie wird interoperabel
Technical Report No. TI-1/01, 20.02.2001

J. Buchmann, L.C. Coronado García, E. Dahmen, M. Döring, E. Klintsevich
CMSS -- An Improved Merkle Signature Scheme
Progress in Cryptology - Indocrypt 2006, LNCS 4329, pp. 349-363, Springer, 2006
CMSS -- An Improved Merkle Signature Scheme (local version)

Luis Carlos Coronado Garcia
Provably Secure and Practical Signature Schemes
Dissertation, 13. Dezember 2005

Carlos Coronado
Can Schönhage multiplication speed up the RSA decryption or encryption?
accepted for MoraviaCrypt ´05 Conference on Cryptology
June 2005

Carlos Coronado
Improvements to the Merkle signature scheme
accepted for MoraviaCrypt ´05 Conference on Cryptology
June 2005

J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmer, R. Weinmann
Post-Quantum Signatures (link)
Oktober 2004

Markus Crnjak
ElGamal-Verschlüsselung mit elliptischen Kurven über Körpern der Charakteristik größer 3
(Diplomarbeit 1999)

Özgür Dagdelen
Algebraische Angriffe auf LFSR basierte Stromchiffren
Bachelor-Arbeit, Oktober 2006

E. Dahmen, K. Okeya, T. Takagi, C. Vuillaume
Digital Signatures out of Second-Preimage Resistant Hash Functions
2nd International Workshop on Post-Quantum Cryptography - PQCrypto 2008, to appear

Sebastian Rohde, Thomas Eisenbarth, Erik Dahmen, Johannes Buchmann, Christof Paar
Efficient Hash-Based Signatures on Embedded Devices
SECSI - Secure Component and System Identification, 2008

Johannes Buchmann, Erik Dahmen, Michael Schneider
Merkle tree traversal revisited
2nd International Workshop on Post-Quantum Cryptography - PQCrypto 2008, to appear

E Dahmen, K. Okeya, D. Schepers
Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography,
12th Australasian Conference on Information Security and Privacy - ACISP´07,
LNCS 4586, Springer, 2007, pp. 245-258.
(lokaler link)

E. Dahmen, K. Okeya, T. Takagi
A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences,
Special Section on Discrete Mathematics and Its Applications,
Volume E90-A, No.5, 2007, pp. 952-959.
(lokaler link)

J. Buchmann, E. Dahmen, A. May, U. Vollmer
Krypto 2020
KES - The Information Security Journal, Nr 5, 2006

Erik Dahmen
Efficient Algorithms for Multi-Scalar Multiplications
Diplomarbeit, November 2005

Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi
Efficient Left-to-Right Multi-Exponentiations
Technical Report No. TI-2/05, 01.11.2005

Erik Dahmen, Katsuyuki Okeya, Tsuyoshi Takagi
An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices
2nd European Workshop on Security and Privacy in Ad hoc and Sensor Networks - ESAS 2005,
LNCS 3813, Springer, 2005, pp. 189-204.

Jens Dambruch
Framework zur flexiblen Formularverarbeitung im Rahmen von FlexiTRUST Formulare, Verarbeitungslogik und Ergebnisse
(Diplomarbeit 07.06.2001)

Thomas Denny
Lösen dünn besetzter Gleichungssysteme über endlichen Körpern
(Dissertation 1997)

Thomas Denny, Volker Müller
On the reduction of composed relations from the number field sieve
(submitted to ANTS96)

O. Schirokauer, D. Weber, T. Denny
Discrete Logarithms: The Effectiveness of the Index Calculus Method
(ANTS 1996)

Thomas Denny
Faktorisieren mit dem Quadratischen Sieb
(Diplomarbeit 1993) (geänderte Version)

Dan Dobre, Matthias Mühleisen
Using the Shared VM Jini Utility
Studienarbeit, WS2002/2003

Denny, Dodson, Lenstra, Manasse
On the factorization of RSA-120
(Crypto 1993)

Johannes Buchmann, Martin Döring, Richard Lindner
Efficiency Improvement for NTRU
Sicherheit 2008, 2.-4. April 2008, Saarbrücken

J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmer, R. Weinmann
Post-Quantum Signatures (link)
Oktober 2004

Johannes Buchmann, Ralf Roth, Matthias Diehl
LiPS: A System for distributed applications
(unpublished 1991)

Maryia Drahavets
Flexible Anbindung von Smartcards an eine Sicherheitsinfrastruktur
Diplomarbeit, August 2006

Johannes Buchmann, Stephan Düllmann
Distributed class group computation
(Festschrift 60. Geburtstag Prof. Hotz 1991)

Stephan Düllmann
Ein Algorithmus zur Bestimmumg positiv definiter binärer quadratischer Formen
(Dissertation 1991)

Johannes Buchmann, Stephan Düllmann
On the computation of discrete logarithms in class groups
(Crypto 1990)

Buchmann, Düllmann, Williams
On the complexity and efficiency of a new key exchange system
(EuroCrypt 1989)

Stephan Düllmann
Ein neues Verfahren zum öffentlichen Schlüsselaustausch
(Staatsexamen 1988)

Marc Eckart
Verwaltung von Identitäten von PKI -Teilnehmern in der Registration Authority
Diplomarbeit, 01. März 2006

Boris Ederov
Merkle Tree Traversal Techniques
Bachelorarbeit, April 2007

Oliver Ehli
ElGamal-Signaturen mit elliptischen Kurven
(Diplomarbeit, Juni 2002)

Johannes Buchmann, Friedrich Eisenbrand
On Factor Refinement in Number Fields
Technical Report No. TI-5/96

Christoph Ender
Verwaltung eines verteilten Systems mit Java und Servlets
(Diplomarbeit, März 2002)

Daniela Engelbert, Raphael Overbeck, Arthur Schmidt
A Summary of McEliece-Type Cryptosystems and their Security
Journal of Mathematical Cryptology, Volume 1, Cover date 2007/04/19, pp 151-199
Print ISSN 1862-2976, Electronic ISSN 1862-2984

J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmer, R. Weinmann
Post-Quantum Signatures (link)
Oktober 2004

Abdelhafid Errabih
Entwurf und Implementierung eines Clients zur Funktionalitätsüberprüfung von Chipkarten - am Beispiel des Heilberufsausweises
Diplomarbeit, Mai 2008

Rong Fan
On the Efficiency Analysis of wNAF and wMOF
Diplomarbeit, 07. September 2005

Lutz Feldgen, Markus Winkler
Design und Implementierung der FlexiTRUST-CA als Java Enterprise Application
(Diplomarbeit, 03.12.2002)

Lutz Feldgen
Analyse von Enterprise Application Servern und Datenbank Management Systemen für FlexiTRUST
(Studienarbeit, 26.09.2002)

Thomas Fertig
Digitale Signaturen mit elliptischen Kurven über GF(2^n)
(Diplomarbeit, März 2000)

Johannes Fischer
Integration von Ebene-1-Softwarefehlertoleranz in LiPS
(Diplomarbeit, 1996)

A. Wiesmaier, M. Fischer, M. Lippert, J. Buchmann
Outflanking and securely using the PIN/TAN-System
accepted for "The 2005 International Conference on Security and Management (SAM´05)"
June 2005

Mike Fischer
Angriff auf ein PIN/TAN-gestütztes Online-Banking-Verfahren
(Diplomarbeit, 2002)

Thomas Setz, Johannes Fischer, Thomas Liefke
libtracer: Eine komfortable Bibliothek zum Generieren levelbasierter Tracing-Ausgaben
Technical Report No. TI-16/97, 12.08.1997

Thomas Setz, Johannes Fischer
Fault-tolerant Distributed Applications in LiPS
Technical Report No. TI-3/96, 17.07.1996

Ralf Flassenberg, Sachar Paulus
Sieving in Function Fields
Technical Report No. TI-13/97, 10.06.1997

Matthias Fleck
Zur Benutzbarkeit von PKI-Anwendungen im praktischen Einsatz
Diplomarbeit, 13. Juni 2006

Sylvain Franke
Deanymisierbare elektronische Zahlungsmittel - ein Verleich zweier Implementationen
(Diplomarbeit, 08.11.2002)

Arnulf Fuhrmann
Verteilte effiziente RSA-Schlüsselerzeugung in JAVA
(Studienarbeit Juli 2000)

Sebastian Fritsch
Towards Secure Electronic Workflows Examples of Applied PKI
Diplomarbeit, 16.02.2006

Marco Ghiglieri
Flexible - Eine erweiterbare GUI für den FlexiProvider (Frontend)
Bachelorarbeit, September 2007

Thilo-Alexander Ginkel
Entwurf und Implementierung eines Authentifikations-Proxys für das World Wide Web Diplomarbeit, Juli 2004

Alexander Grahl, Tekla Kiss
Entwurf und Implementierung einer Web-Test Anwendung und Integrierung in die Eclipse IDE
Diplomarbeit, 25.06.2004

Clemens Groß
Ein Verschlüsselungsprotokoll auf Basis von reellquadratischen Zahlkörpern
(Diplomarbeit 24.04.2000)

Olaf Gross
Der Block Lanczos Algorithmus über GF(2)
(Diplomarbeit 1994)

Abdellah Guaadaoui
Sicherheitsdefinitionen für Challenge-Response-Identifikationsverfahren Diplomarbeit

Axel Hagedorn
IEEE 802.11i
Sicherheit in drahtlosen lokalen Netzen
Diplomarbeit, November 2003

Jochen Hähnle
Design und Entwicklung eines Testframeworks für JLiPSD
Diplomarbeit, März 2003

T. Hahn, A. Meyer, S. Neis, Th. Pfahler
Implementing Cryptographic Protocols Based on Algebraic Number Fields
Technical Report No. TI-24/99, 23.12.1999

Safuat Hamdy
Über die Sicherheit und Effizienz kryptographischer Verfahren mit Klassengruppen imaginär-quadratischer Zahlkörper (Dissertation, 20.03.2002)

Johannes Buchmann, Safuat Hamdy
A Survey on IQ Cryptography
Technical Report No. TI-4/01, 21.03.2001

Safuat Hamdy, Bodo Möller
Security of Crytosystems Based on Class Groups of Imaginary Quadratic Orders
Technical Report No. TI-4/00, 29.05.2000, (revised version appeared at ASIACRYPT 2000)

Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
A Signature Scheme Based on the Intractability of Computing Roots
Technical Report No. TI-1/00, 22.02.2000 - updated: 15.06.2000

Safuat Hamdy, Markus Maurer
Feige-Fiat-Shamir Identification Based on Real Quadratic Fields
Technical Report No. TI-23/99, 23.12.1999

Safuat Hamdy
Elliptische Kurven - Neue Wege in der Public-Key-Kryptographie
Technical Report No. TI-5/99, 23.04.1999

Ralf Hammen
Integrationskonzept für Trustcenter-Software
(Diplomarbeit 2002)

Ralf Handl
Sicherheit kryptographischer Protokolle
(Dissertation 1994)

Michael Hartmann
Implementierung der Entschlüsselung des NICE-Kryptosystems auf einer Smartcard
(Diplomarbeit 1999)

Michael Hartmann, Sönke Maseberg
Fail-Safe-Konzept für Public-Key-Infrastrukturen
Technical Report No. TI-1/02, 30.01.2002

Michael Hartmann, Sönke Maseberg
Smart Cards for the FlexiPKI Environment
Technical Report No. TI-9/01, 29.05.2001

Michael Hartmann, Sönke Maseberg
Fail-Safe-Konzept für FlexiPKI
Technical Report No. TI-11/00, 14.12.2000

Michael Hartmann, Sachar Paulus, Tsuyoshi Takagi
NICE - New Ideal Coset Encryption -
Technical Report No. TI-11/99, 18.05.1999

Jochen Hechler
Primzahlnachweis mit Hilfe elliptischer Kurven
Diplomarbeit, Oktober 2003

Jürgen Henge-Ernst, Sebastian Linke
Anbindung einer Personalisierungssstrasse an das FlexiTRUST-System
(Studienarbeit, WS2001/2002)

Birgit Henhapl
Zur Effizienz von elliptische Kurven Kryptographie
(Dissertation, Dezember 2003)

Birgit Henhapl
Platform Independant Elliptic Curve Cryptography over Fp
Technical Report No. TI-6/02

M.Ernst, B. Henhapl, S. Huss, S. Klupsch
FPGA based Hardware Acceleration for Elliptic Curve Public Key Cryptosystems
Diese Arbeit wurde in Zusammenarbeit mit Herrn Huss´ Arbeitsgruppe gemacht, sie ist angenommen, darf aber nicht anderweitig veröffentlicht werden.

Birgit Henhapl
Digitales Signieren mit Elliptischen Kurven über Primkörpern großer Charakteristik
(Diplomarbeit 1999)

Markus Ernst, Birgit Henhapl
High Performance ECDSA over F(2^n) based on Java with Hardware Acceleration
Technical Report No. TI-6/01, 07.04.2001

Christina Hölzer
Quantenalgorithmus für das Hauptidealproblem
Diplomarbeit, 02.06.2003

Frank Homann
Flexibles Datenbankmodell für TrustCenter
Diplomarbeit, Oktober 2004

Detlef Hühnlein
Kryptosysteme auf Basis imaginärquadratischer Nichtmaximalordnungen
Dissertation 2004

Detlef Hühnlein, Tsuyoshi Takagi
Reducing logarithms in totally non-maximal imaginary quadratic orders to logarithms in finite fields
Technical Report No. TI-8/99, 06.06.1999

Detlef Hühnlein, Andreas Meyer, Tsuyoshi Takagi
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Technical Report No. TI-7/99, 05.05.1999

Detlef Hühnlein
Efficient implementation of cryptosystems based on non-maximal imaginary quadratic orders
Technical Report No. TI-6/99, 26.04.1999

Detlef Hühnlein
Credential Management and Secure Single Login for SPKM
Technical Report No. TI-28/97, 17.11.1997

Detlef Hühnlein, Michael J. Jacobson, Jr., Sachar Paulus
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
Technical Report No. TI-24/97, 10.10.1997

Carmen Hiber
Eine Untersuchung der verbesserten Buchberger Algorithmen zur Gröbnerbasen-Konstruktion
(Diplomarbeit 1995)

Christine Hollinger, jetzt Abel
Ein Algorithmus zur Berechnung der Klassenzahl und des Regulators reellquadratischer Ordnungen
(Dissertation 1994)

Johannes Buchmann, Christine Hollinger
On smooth ideals in number fields
(submitted to Journal of Number Theory, 1993)

Heiko Hornung
Ein Framework zur Automatisierung von Tests formularbasierter Web-Anwendungen
(Diplomarbeit, März 2002)

Detlef Hühnlein
Faster Generation of NICE-Schnorr-type Signatures
Technical Report No. TI-8/00, 18.10.2000

Detlef Hühnlein
Quadratic orders for NESSIE - Overview and parameter sizes of three public key families
Technical Report No. TI-3/00, 31.03.2000

Detlef Hühnlein
Elliptische Kurven in HBCI - ein Backup zu RSA
Technical Report No. TI-20/99, 30.11.1999

Detlef Hühnlein
A survey of crytosystems based on imaginary quadratic orders (extended abstract)
Technical Report No. TI-19/99, 30.11.1999

Detlef Hühnlein, Johannes Merkle
An efficient NICE-Schnorr-type signature
Technical Report No. TI-18/99, 17.10.1999

Detlef Hühnlein, Johannes Merkle
Secure and cost efficient electronic stamps
Technical Report No. TI-17/99, 28.09.1999

Michael Hürter
Modifikationen zum Number Field Sieve
(Diplomarbeit 1994)

Jan Huthmann
Datengesteuerte Initialisierung komplexer Softwaresysteme als Voraussetzung zentralisierter Konfiguration
Diplomarbeit, September 2007

Johannes Buchmann, Michael J. Jacobson, Stefan Neis, Patrick Theobald, Damian Weber
Sieving Methods for Class Group Computation
Technical Report No. TI-8/98, 01.10.1998

Detlef Hühnlein, Michael J. Jacobson, Jr., Sachar Paulus
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
Technical Report No. TI-24/97, 10.10.1997

Michael J. Jacobson, Jr.
Applying Sieving to the Computation of Quadratic Class Groups
Technical Report No. TI-19/97, 09.10.1997

J. Buchmann, M. Jacobson jr., E. Teske
On some computational problems in finite abelian groups
(Technical Report No. TI-2/96, to appear in Mathematics of Computation 1996)

Johannes Buchmann, Michael Jacobson, Edlyn Teske
On some computational problems in finite abelian groups
Technical Report No. TI-2/96, 17.07.1996,
appear in Mathematics of Computation 1996

Benjamin Kahl
Blinde Signaturen und Post-Quantum-Kryptographie
Diplomarbeit, Dezember 2007

Markus Kaiser, Johannes Buchmann
Computer Verification in Cryptography
in Proceedings ICCS´06 Vienna, Austria, Volume 12,
March 29-31, 2006, ISBN 975-00803-1-9

Igor Kalenderian
Implementierung des Austausches kryptographischer Komponenten in FlexiPKI mittels Update Management Protocol
(Diplomarbeit, 06. November 2001)

Evangelos Karatsiolis
Flexible Certificate Management in Public Key Infrastructures

M. Lippert, V. Karatsiolis, A. Wiesmaier, J. Buchmann
Lifecycle management of X.509 certificates based on LDAP directories
Journal of Computer Security, 14(5):419-439, September 2006

Marcus Lippert, Evangelos Karatsiolis, Alexander Wiesmaier
Design of a Registration Authority
to be published

V. Karatsiolis, M. Lippert, A. Wiesmaier
Planning for Directory Services in Public Key Infrastructures (pdf, ps.gz)
in Proceedings of Sicherheit 2005 - QSIG2005

Alexander Wiesmaier, Marcus Lippert, Vangelis Karatsiolis
The Key Authority - Secure Key Management in Hierarchical Public Key Infrastructures
In Proceedings of the International Conference on Security and Management, pages 89-93. CSREA Press, June 2004

Vangelis Karatsiolis, Marcus Lippert, Alexander Wiesmaier
Using LDAP Directories for Management of PKI Processes
n Proceedings of Public Key Infrastructure: First European PKI Workshop: Research and Applications, EuroPKI 2004, volume 3093 of Lecture Notes in Computer Science, pages 126-134, June 2004

Tobias Kern
Next Generation Usability of Cryptography
Combining FlexiProvider and JCrypTool
Diplomarbeit, 10. Juli 2008

Sabine Köhler
Sicherheitsparameter für dasOkamoto- Tanaka-Uchiyama Quanten-Public-Key-Kryptosystem
Diplomarbeit, Mai 2006

Kai Kramer
Trustcentermigration - Umstellung von LiDIA-CA auf evaluierte Prozesse

Holger Kenn
Entwurf eines einfachen Client-Server-Systems zur Verteilung von Schlüsseldaten asymmetrischer Kryptosysteme
(Diplomarbeit 1997)

Johannes Buchmann, Volker Kessler
Computing a reduced lattice basis from a generating system
(unpublished, 1992)

Patrick Keuschen
Entwurf und Implementierung von ojekt-orientierten Bibliotheksroutinen zur Realisierung von Secret Sharing Schemata
(Diplomarbeit 1996)

Klaus Kiefer
A New Fast and Secure Cryptosystem
Technical Report No. TI-8/96, 05.12.1996

Alexander Grahl, Tekla Kiss
Entwurf und Implementierung einer Web-Test Anwendung und Integrierung in die Eclipse IDE
Diplomarbeit, 25.06.2004

Alexander Klink
Cryptographic Voting Protocols - A Prototype Design and Implementation for University Elections at TU Darmstadt
Diplomarbeit, März 2006

Thorsten Knabe
PVM-LiPS - Integration einer PVM-Laufzeitumgebung in LiPS
(Diplomarbeit August 2000)

Thorsten Knabe
LiPS basiertes Job Queueing System für LiDIA
Technical Report No. TI-1/99, 27.01.1999

Sabine Köhler
Sicherheitsparameter für dasOkamoto-Tanaka-Uchiyama Quanten-Public-Key-Kryptosystem
Diplomarbeit, Mai 2006

Inna Kotchourova
An Approach for Formal and Computer Verification in Cryptography
Bachelor-Arbeit, September 2006

Sarah Kraatz
Generische Konstruktion von Fail-Stop Signatur Schemata
Diplomarbeit, 26. April 2005

Alexander Kreuder
Ein neuer Reduktionsbeweis für das RSA-Paillier Kryptosystem
(Diplomarbeit, Oktober 2003)

Dennis Kügler
Ein mißbrauchfreies anonymes elektonisches Zahlungssystem
Dissertation, 13.08.2002

Dennis Kügler, Holger Vogt
Off-line Payments with Auditable Tracing
Technical Report No. TI-8/02

Dennis Kügler, Holger Vogt
Auditable Tracing with Unconditional Anonymity
Technical Report No TI-16/01

Dennis Kügler, Holger Vogt
Unsichtbare Markierungen in elektronischem Geld
Technical Report No TI-15/01

Dennis Kügler, Holger Vogt
Fair Tracing without Trustees
Technical Report No TI-14/01

Dennis Kügler
Eine Aufwandsanalyse für identitätsbasierte Kryptosysteme
(Diplomarbeit 1998)

Dennis Kügler, Holger Vogt
Marking: A Privacy Protecting Approach against Blackmailing
Technical Report No. TI-9/00, 18.10.2000

Dennis Kügler, Markus Maurer
A Note on the Weakness of the Maurer-Yacobi Squaring Method
Technical Report No. TI-15/99, 18.10.1999

Dennis Kügler, Markus Maurer, Sachar Paulus
Identitätsbasierte Kryptosysteme als Alternative zu Public Key Infrastrukturen
Technical Report No. TI-3/99, 02.02.1999

Sebastian Kusch
Formalizing the DSA Signature Scheme in Isabelle/HOL
Diplomarbeit, Dezember 2006

Daniel Kwiotek
Entwicklung einer sicheren Web-Schnittstelle für eine bestehende Enterprise-Anwendung basierend auf PKI-Technologien am Beispiel der ERP-Software ProAd
(Diplomarbeit, Sepember 2002)

Lucie Langer, Axel Schmidt
Onlinewahlen mit Wahldiensteanbieter - das Verbundprojekt voteremote
To appear in the proceedings of the EDem08 conference, September 2008

Lucie Langer, Axel Schmidt, and Roberto Araújo
A pervasively verifiable online voting scheme
To appear in the proceedings of the Informatik 2008 conference, September 2008

Rotraud Gitter, Lucie Langer, Susanne Okunick, and Zoi Opitz-Talidou
Long-term retention in e-voting -- Legal requirements and technical implementation
To appear in the proceedings of the EVOTE08 conference, August 2008

Lucie Langer
Stromchiffren - Entwurf, Einsatz und Schwächen
Diplomarbeit, Juli 2006

Lucie Langer, Axel Schmidt, Johannes Buchmann
Secure Online Elections in Practice
Cryptology eprint Archive, Report 2008/157, April 2008

Frank Lehmann
Implementierung von Algorithmen zur Berechnung modularer Polynome und deren Anwendung im Algorithmus von Atkin
(Diplomarbeit 1994)

Julian Lehmann
Fast Elliptic Curve Operation Costs and Comparison of Sole Inversion Precomputation Schemes
Bachelorarbeit, August 2008

Qin Lei
Design and Implementation of Secure Email for BlackBerry Devices -
Solutions in the enterprise context
Diplomarbeit, 2008

J. Buchmann, H.W. Lenstra jr.
Approximating rings of integers in number fields
(submitted to Seminaire de Theorie des Nombres Bordeaux)

Denny, Dodson, Lenstra, Manasse
On the factorization of RSA-120
(Crypto 1993)

Thomas Liefke, Ohad Rodeh, Thomas Setz
First Steps in the Implementation of a Fault-Tolerant Tuple - Space Machine for Volatile Data
Technical Report No. TI-13/99, 15.06.1999

Thomas Liefke, Thomas Setz
Extension of the TRIPS Prototype
Report about research carried out at the Hebrew University of Jerusalem, Israel
Technical Report No. TI-12/99, 15.06.1999

Thomas Liefke
Tupleview: towards a Monitoring, Debugging and Profiling Tool for LiPS
(Diplomarbeit 1997)

Thomas Liefke, Thomas Setz
Tupleview - ein Monitoring-, Debugging- und Profiling-Tool für LiPS
Technical Report No. TI-37/97, 25.11.1997

Thomas Setz, Johannes Fischer, Thomas Liefke
libtracer: Eine komfortable Bibliothek zum Generieren levelbasierter Tracing-Ausgaben
Technical Report No. TI-16/97, 12.08.1997

Thomas Setz, Thomas Liefke
The LiPS Runtime Systems
Technical Report No. TI-6/97, 11.02.1997

Thorsten Liese
Eine Software zur automatisierten Erstellung von IEEE829-Testdokumentationen
Diplomarbeit, 16.04.2003

Christina Lindenberg, Kai Wirt, Johannes Buchmann
Formal Proof for the Correctness of RSA-PSS
Cryptology ePrint Archive, Report 2006/011, http://eprint.iacr.org/2006/011

Johannes Buchmann, Richard Lindner, Markus Rückert
Explicit hard instances of the shortest vector problem

Johannes Buchmann, Martin Döring, Richard Lindner
Efficiency Improvement for NTRU
Sicherheit 2008, 2.-4. April 2008, Saarbrücken

Richard Lindner
Parameter für NTRU-Sign
Diplomarbeit, 2006

Jürgen Henge-Ernst, Sebastian Linke
Anbindung einer Personalisierungssstrasse an das FlexiTRUST-System
(Studienarbeit, WS2001/2002)

M. Lippert, V. Karatsiolis, A. Wiesmaier, J. Buchmann
Lifecycle management of X.509 certificates based on LDAP directories
Journal of Computer Security, 14(5):419-439, September 2006

Marcus Lippert, Evangelos Karatsiolis, Alexander Wiesmaier
Design of a Registration Authority
to be published

V. Karatsiolis, M. Lippert, A. Wiesmaier
Planning for Directory Services in Public Key Infrastructures (pdf, ps.gz)
in Proceedings of Sicherheit 2005 - QSIG2005

Alexander Wiesmaier, Marcus Lippert, Vangelis Karatsiolis
The Key Authority - Secure Key Management in Hierarchical Public Key Infrastructures
Proceedings of the International Conference on Security and Management, pages 89-93. CSREA Press, June 2004

Vangelis Karatsiolis, Marcus Lippert, Alexander Wiesmaier
Using LDAP Directories for Management of PKI Processes
In Proceedings of Public Key Infrastructure: First European PKI Workshop: Research and Applications, EuroPKI 2004, volume 3093 of Lecture Notes in Computer Science, pages 126-134, June 2004

Marcus Lippert
Ein beweisbar sicherer Pseudoufallsbit-Generator auf der Basis des DL-Problems in elliptischen Kurven
(Diplomarbeit 28.12.2000)

Jens Lippmann
Integration einer Testumgebung in LiPS
(Diplomarbeit 1997)

Thomas Setz, Jens Lippmann
Softwaretesten in LiPS
Technical Report No. TI-36/97, 25.11.1997

J. Buchmann, J. Loho, J. Zayer
An implementation of the general number field sieve
(Crypto 1993)

Jürgen Loho
Die Implementierung des Number Field Sieve
(Diplomarbeit 1991)

A. Wiesmaier, U. Rauchschwalbe, C. Ludwig, M. Ruppert, and J. Buchmann
Intrinsically Legal-For-Trade Objects by Digital Signatures
(local version)
in "Proceedings of Sicherheit 2006"
February 2006

Christoph Ludwig
Practical Lattice Basis Sampling Reduction
Dissertation, 13. Dezember 2005

Johannes Buchmann, Christoph Ludwig
Practical Lattice Basis Sampling Reduction
In: F. Hess, S. Pauli, M. Pohst (Eds.): Proceedings of ANTS 2006, Springer LNCS 4076, pp. 222-237, 2006

J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmer, R. Weinmann
Post-Quantum Signatures (link)
Oktober 2004

Christoph Ludwig
A Faster Lattice Reduction Method Using Quantum Search
Technical Report No. TI-3/03, 21.02.2003 (revised version published at ISAAC 2003)

Christoph Ludwig
The Security and Efficiency of Micciancio´s Cryptosystem
Technical Report No. TI-7/02

Feng Lue
Security Analysis of RSA Cryptosystem Against Side Channel Attacks
Diplomarbeit, Sommer 2004

Hristo Lulev
Overview of Bit Commitment Schemes
Bachelorarbeit, 16.Dezember 2007

Denny, Dodson, Lenstra, Manasse
On the factorization of RSA-120
(Crypto 1993)

Sönke Maseberg
Fail-Safe-Konzept für Public-Key-Infrastrukturen ( pdf,ps.gz)

Michael Hartmann, Sönke Maseberg
Fail-Safe-Konzept für Public-Key-Infrastrukturen
Technical Report No. TI-1/02, 30.01.2002

Michael Hartmann, Sönke Maseberg
Smart Cards for the FlexiPKI Environment
Technical Report No. TI-9/01, 29.05.2001

Michael Hartmann, Sönke Maseberg
Fail-Safe-Konzept für FlexiPKI
Technical Report No. TI-11/00, 14.12.2000

Alexander Matzies
Implementierung flexibler Skalarmultiplikation auf Elliptischen Kurven
Diplomarbeit, 17.12.2007

Markus Maurer
Regulator approximation and fundamental unit computation for real-quadratic orders
(Dissertation 13.11.2000)

Johannes Buchmann, Markus Maurer, Bodo Möller
Cryptography Based on Number Fields with Large Regulator
Technical Report No. TI-5/00, 06.06.2000

Safuat Hamdy, Markus Maurer
Feige-Fiat-Shamir Identification Based on Real Quadratic Fields
Technical Report No. TI-23/99, 23.12.1999

Dennis Kügler, Markus Maurer
A Note on the Weakness of the Maurer-Yacobi Squaring Method
Technical Report No. TI-15/99, 18.10.1999

Dennis Kügler, Markus Maurer, Sachar Paulus
Identitätsbasierte Kryptosysteme als Alternative zu Public Key Infrastrukturen
Technical Report No. TI-3/99, 02.02.1999

Johannes Buchmann, Markus Maurer
Wie sicher ist die Public-Key-Kryptographie?
Technical Report No. TI-2/99, 28.01.1999

Johannes Buchmann, Markus Maurer
Approximate Evaluation of L(1,chi-delta)
Technical Report No. TI-6/98, 16.04.1998

Markus Maurer
The logarithm function in LiDIA´s bigfloat class
Technical Report No. TI-33/97, 19.11.1997

Markus Maurer
Eine Implementierung des Algorithmus von Atkin zur Berechnung der Punktanzahl elliptischer Kurven über endlichen Primkörpern der Charakteristik größer drei
(Diplomarbeit 1994)

Organizers: Johannes Buchmann, Alexander May, Ulrich Vollmer
CLC2006 - Workshop on Codes and Lattices in Cryptography
CLC2006 Preproceedings
25.-27. September 2006

J. Buchmann, E. Dahmen, A. May, U. Vollmer
Krypto 2020
KES - The Information Security Journal, Nr 5, 2006

Johannes Buchmann, Alexander May, Ulrich Vollmer
"Perspectives for Cryptographic Long-Term Security"
Communications of the ACM, Vol. 49(9), 50-56, 2006

Patrick Merscher
Standards fuer objektorientiertes Programmieren in der Computeralgebra
(Diplomarbeit 1992)

Andreas Meyer
Über die Sicherheit und Effizienz kryptographischer Verfahren in algebraischen Zahlkörpern
Dissertation, 05. Januar 2006

Andreas Meyer, Stefan Neis, Thomas Pfahler
First Implementation of Cryptographic Protocols Based on Algebraic Number Fields
(ACISP 2001)

Ingrid Biehl, Johannes Buchmann, Safuat Hamdy, Andreas Meyer
A Signature Scheme Based on the Intractability of Computing Roots
Technical Report No. TI-1/00, 22.02.2000 - updated: 15.06.2000

T. Hahn, A. Meyer, S. Neis, Th. Pfahler
Implementing Cryptographic Protocols Based on Algebraic Number Fields
Technical Report No. TI-24/99, 23.12.1999

Detlef Hühnlein, Andreas Meyer, Tsuyoshi Takagi
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Technical Report No. TI-7/99, 05.05.1999

Andreas Meyer
Ein neues Identifikations- und Signaturverfahren über imaginär-quadratischen Klassengruppen
(Diplomarbeit 1997)

Mohammed Meziani
Konstruktion von Hashfunktionen
Diplomarbeit, August 2007

Johannes Müller
Portierung des FlexiProviders auf JavaMicroEdition
Diplomarbeit, 09. November 2007

Bernd Meyer, Volker Müller
A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring
(Advances in Cryptology - Eurocrypt ´96, Lecture Notes in Computer Science 1070, 1996 (with Bernd Meyer)

Ingrid Biehl, Bernd Meyer
Protocols for Collusion-Secure Asymmetric Fingerprintig
Technical Report No. TI-1/96, 16.07.1996

Bernd Meyer
Zur Trennung von Klassen ununterscheidbarer Ensembles
(Dissertation 1995)

Buchmann, Biehl, Meyer, Thiel, Thiel
Tools for proving zero knowledge
(EuroCrypt 1992)

Bernd Meyer
Bit-Commitment-Schemes und Zero-Knowledge
(Diplomarbeit 1992)

Ulrike Meyer
Secure Roaming and Handover Procedures in Wireless Access Networks
Dissertation, 20. Dezember 2005

U. Meyer, J. Cordasco and S. Wetzel
"An Approach to Enhance Inter-Provider Roaming Through Secret Sharing and its Application to WLANs"
to appear in: Proceedings of the ACM Workshop on Wireless Mobile Applications and Severices on WLAN Hotspots
September 2005, Koeln, Deutschland

Ulrike Meyer, Susanne Wetzel
A man-in-the-middle attack on UMTS
Appeared in the proceedings of the ACM Workshoph on Wireless Security (WiSe 2004), October 2004

Ulrike Meyer, Kira Kastell, Adrian Fernandez-Pello, Diego Perez, Rolf Jakoby
Advantage and Use of a Location Based Handover Algorithm
Appeared in the proceedings of the IEEE conference VTC2004-Fall, September 2004

Ulrike Meyer, Susanne Wetzel
On the Impact of GSM Encryption and Man-in-the-middle Attacks on the Security of Interoperating GSM/UMTS Networks (link)
Appeared in the proceedings of the IEEE conference PIMRC´04, September 2004

Kira Kastell, Ulrike Meyer, Rolf Jakoby
Secure Handover Procedures
Technical Report No. TI-8/03 (appeared at CIC 2003)

Maurice Mignotte, Attila Pethö, Ralf Roth
Complete solutions of a family of quartic Thue and index form equations
(submitted to Mathematics of Computation)

Jintai Ding, Johannes Buchmann, Mohamed Saied Emam Mohamed, Wael Said Abd Elmageed Mohamed and Ralf-Philipp Weinmann
MutantXL
In Proceedings of the SCC 2008

Bodo Möller
Public-Key Cryptography - Theory and Practice
(Dissertation, 16. September 2003)

Tetsuya Izu, Bodo Möller, Tsuyoshi Takagi
Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks
(INDOCRYPT 2002)

Bodo Möller
Parallelizable Elliptic Curve Point Multiplication Method with Resistance against Side-Channel Attacks
(ISC 2002)

Bodo Möller
Improved Techniques for Fast Exponentiation
(ICISC 2002)

Bodo Möller
Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes
Technical Report No. TI-5/02 (revised version to appear at CT-RSA 2003)

Bodo Möller
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks (ISC 2001)

Bodo Möller
Algorithms for multi-exponentiation
Technical Report No. TI-8/01, 27.04.2001 (revised version appeared at SAC 2001)

Johannes Buchmann, Markus Maurer, Bodo Möller
Cryptography Based on Number Fields with Large Regulator
Technical Report No. TI-5/00, 06.06.2000

Safuat Hamdy, Bodo Möller
Security of Crytosystems Based on Class Groups of Imaginary Quadratic Orders
Technical Report No. TI-4/00, 29.05.2000, (revised version appeared at ASIACRYPT 2000)

Marco Möller
Information Theoretical Models for Hierarchical Structured Agents and their Computation
Informationtheoretische Modelle für hierarchisch strukturierte Agenten und ihre Berechnung
(deutsche Zusammenfassung)
Bachelorarbeit, April 2008

Andreas Monstadt
Eine Entwicklungsumgebung für die objektorientierte Bibliothek LiDIA
(Diplomarbeit 1996)

Dan Dobre, Matthias Mühleisen
Using the Shared VM Jini Utility
Studienarbeit, WS2002/2003

Achim Müller
Effiziente Algorithmen für Probleme der linearen Algebra über \Z
(Diplomarbeit 1994)

Andreas Rudolf Müller
JLiPSD - eine Portierung des lipsd nach Java (htm, doc)
(Diplomarbeit, Oktober 2002)

Andreas Müller
Eine FFT-Continuation für die elliptische Kurvenmethode
(Diplomarbeit 1995)

Tobias Müller
Sicherheitsparameter für Regevs Kryptosystem
Diplomarbeit, 07.12.2004

Volker Müller, Sachar Paulus
Elliptische Kurven und Public Key Kryptographie
(to appear in DUD-Fachberichte Kryptographie 1998)

Volker Müller, Sachar Paulus
On the Generation of Cryptographically Strong Elliptic Curves
Technical Report No. TI-25/97, 10.10.1997

Volker Müller
Efficient Algorithms for Multiplication on Elliptic Curves
Technical Report No. TI-9/97, 22.04.1997

Volker Müller
Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two
Technical Report No. TI-4/97, 27.01.1997

Volker Müller, Andreas Stein, Christoph Thiel
Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus
(To be published in Mathematics of Computation 1997)

Volker Müller
Efficient Algorithms for Multiplication on Elliptic Curves
(Accepted for "GI - Arbeitskonferenz Chipkarten Muenchen 1998")

Volker Müller with Scott Vanstone, Robert Zuccherato
Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2
(to appear in Designs, Codes and Cryptography, 1997)

Volker Müller
Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two
(to appear in Journal of Cryptology 1997)

Thomas Denny, Volker Müller
On the reduction of composed relations from the number field sieve
(Proceedings of ANTS II, LNCS 1122, 1996)

Bernd Meyer, Volker Müller
A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring
(Proceedings of Eurocrypt 1996, LNCS 1070, 1996)

Volker Müller
Ein Algorithmus zur Bestimmung der Punktanzahl elliptischer Kurven über Körpern der Charakteristik größer drei (Dissertation 1995)

Johannes Buchmann, Volker Müller
Computing the number of points on elliptic curves over finite prime fields
(ISSAC 1991)

Volker Müller
Berechnung der Punktanzahl Elliptischer Kurven ueber endlichen Primkoerpern
(Diplom-Arbeit 1991)

Frank Nauheimer
Development of a lattice based blind signature scheme
Diplomarbeit, 11. 06. 2007

Petra Naumann-Kipper
Interaktive Beweissysteme und Arthur-Merlin-Beweissysteme
(Diplomarbeit 1992)

Stefan Neis
Zur Berechnung von Klassengruppen
(Dissertation 2002)

T. Hahn, A. Meyer, S. Neis, Th. Pfahler
Implementing Cryptographic Protocols Based on Algebraic Number Fields
Technical Report No. TI-24/99, 23.12.1999

Andreas Meyer, Stefan Neis, Thomas Pfahler
First Implementation of Cryptographic Protocols Based on Algebraic Number Fields
(ACISP 2001)

Stefan Neis
Reducing Ideal Arithmetic to Linear Albebra Problems
Technical Report No. TI-9/98, 01.10.1998

Johannes Buchmann, Michael J. Jacobson, Stefan Neis, Patrick Theobald, Damian Weber
Sieving Methods for Class Group Computation
Technical Report No. TI-8/98, 01.10.1998

Johannes Buchmann, Stefan Neis
Algorithms for Linear Algebra Problems over Principal Ideal Rings
Technical Report No. TI-7/96, 28.11.1996

Stefan Neis
Kurze Darstellungen von Ordnungen
(Diplomarbeit 1994)

Paul Cesar Nguentcheu
Analyse, Design und Implementierung von Krypto-Verfahren zur sicheren Netzwerkkommunikation
Diplomarbeit, 12. Oktober 2007

Robert Niebuhr
Application of Algebraic-Geometric Codes in Cryptography
Diplomarbeit, 13. Januar 2006

Markus Nüsseler
Sicherer Zugangsschutz mit Hilfe eines Einmalpaßwortgenerators auf einer Chipkarte
(Diplomarbeit 1998)

Mihaela Nussbaumer
Elektronische (Langzeit-)Archivierung mit Hilfe digitaler Signaturen
Diplomarbeit, März 2008

Dirk grosse Osterhues
On Securing Unix Systems with Smart Cards
Studienarbeit, 16. Oktober 2005

Raphael Overbeck
Public Key Cryptography based on Coding Theory
Dissertation, 24. April 2007

P. Loidreau, R. Overbeck
Decoding rank errors beyond the error-correction capability
Proc. of ACCT-10, Zvenigorod, 2006

Raphael Overbeck
Statistical decoding revisited
Proc. of ACISP 2006,
volume 4058 of LNCS, pp. 283-294, Springer Verlag 2006;
available at Springer Link.

Raphael Overbeck
A new structural attack for GPT and variants
Proc. of Mycrypt 2005, volume 3715 of LNCS, pages 50-63, Springer Verlag 2005;
Available at Springer Link.

R. Overbeck
Extending Gibson´s attacks on the GPT Cryptosystem
Proc. of WCC2005, March 14-18, 2005, Bergen (Norway),
volume 3969 of LNCS, pp. 178-188, Springer Verlag 2005; Available at Springer Link

J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmer, R. Weinmann
Post-Quantum Signatures (link)
Oktober 2004

Raphael Overbeck
Potential und Grenzen der Anwendung von Gitterreduktionsalgorithmen in der Kryptographie (pdf, ps.gz)
(Diplomarbeit, 11. März 2004)

Krasimira Pancheva
On Lattices, Codes and Regev´s Cryptosystem
Bachelorarbeit, Mai 2007

Thomas Papanikolaou
Entwurf und Entwicklung einer objektorientierten Bibliothek für algorithmische Zahlentheorie
(Dissertation 1997)

Thomas Papanikolaou, Jörg Zayer
ALGO.STY - a LaTex style for algorithm editing
Technical Report No. TI-18/97, 08.10.1997

Thomas Papanikolaou
Technical documentation using a C++ to LaTex formatting program
Technical Report No. TI-17/97, 08.10.1997

Bruno Haible, Thomas Papanikolaou
Fast multiprecision evaluation of series of rational numbers Technical Report No. TI-7/97, 18.03.1997

Thomas Papanikolaou
libF - Eine lange Gleitpunktarithmetik
(Diplomarbeit 1993)

Sebastian Pape
Sicherheitsmodelle für das Ajtai-Dwork-Kryptosystem (pdf, ps.gz)
(Diplomarbeit, Januar 2004)

Michael Hartmann, Sachar Paulus, Tsuyoshi Takagi
NICE - New Ideal Coset Encryption -
Technical Report No. TI-11/99, 18.05.1999

Ingrid Biehl, Sachar Paulus, Tsuyoshi Takagi
Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders
Technical Report No. TI-10/99, 18.05.1999

Sachar Paulus, Tsuyoshi Takagi
A new public-key cryptosystem over quadratic orders with quadratic decryption time
Technical Report No. TI-9/99, 18.05.1999

Dennis Kügler, Markus Maurer, Sachar Paulus
Identitätsbasierte Kryptosysteme als Alternative zu Public Key Infrastrukturen
Technical Report No. TI-3/99, 02.02.1999

Steven D. Galbraith, Sachar Paulus, Nigel P. Smart
Arithmetic on Superelliptic Curves
Technical Report No. TI-11/98, 12.10.1998

Sachar Paulus, Tsuyoshi Takagi
A generalization of the Diffie-Hellman problem and related cryptosystems allowing fast decryption
Technical Report No. TI-5/98, 16.02.1998

Sachar Paulus
Lattice Basis Reduction in Function Fields
Technical Report No. TI-2/98, 13.01.1998

Sachar Paulus, Thomas Setz
Developing and Testing a Smart Card Application
Technical Report No. TI-27/97, 13.10.1997

Sachar Paulus, Hans-Georg Rück
Real and imaginary quadratic representations of hyperelliptic function fields
Technical Report No. TI-14/97, 24.06.1997

Ralf Flassenberg, Sachar Paulus
Sieving in Function Fields
Technical Report No. TI-13/97, 10.06.1997

Volker Müller, Sachar Paulus
Elliptische Kurven und Public Key Kryptographie
(to appear in DUD-Fachberichte Kryptographie 1998)

Sachar Paulus
MAJA - Das Konzept eines Multi Application JavaCard Environment
Technical Report No. TI-34/97, 25.11.1997

Volker Müller, Sachar Paulus
On the Generation of Cryptographically Strong Elliptic Curves
Technical Report No. TI-25/97, 10.10.1997

Detlef Hühnlein, Michael J. Jacobson, Jr., Sachar Paulus
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
Technical Report No. TI-24/97, 10.10.1997

Johannes Buchmann, Sachar Paulus
A one way function based on ideal arithmetic in number fields Technical Report No. TI-5/97

Sachar Paulus
Ein Algorithmus zur Berechnung der Klassengruppe quadratischer Ordnungen über Hauptidealringen
(Dissertation 1996)

Johannes Buchmann, Sachar Paulus
Algorithms for finite abelian groups
(submitted to Moscow 1993)

Sachar Paulus
Algorithmen fuer endliche abelsche Gruppen
(Diplomarbeit 1992)

Tsvetan Penev
Identity Based Public Key Infrastructures
Bachelor-Arbeit, August 2005

Markus Peter
Angriffe auf das McEliece Kryptosystem
Diplomarbeit, Januar 2006

Markus Peter
Effizienz- und Sicherheitsanalyse von Micropayment Systemen
Studienarbeit, Winter 2004/2005

Andreas Petter
Kryptographie mit algebraischen Zahlkörpern: Relevante Schlüssellängen
(Diplomarbeit 2001)

Andreas Meyer, Stefan Neis, Thomas Pfahler
First Implementation of Cryptographic Protocols Based on Algebraic Number Fields
(ACISP 2001)

T. Hahn, A. Meyer, S. Neis, Th. Pfahler
Implementing Cryptographic Protocols Based on Algebraic Number Fields
Technical Report No. TI-24/99, 23.12.1999

Thomas Pfahler
Polynomfaktorisierung über endlichen Körpern
Diplomarbeit 1997

Maurice Mignotte, Attila Pethö, Ralf Roth
Complete solutions of a family of quartic Thue and index form equations
(submitted to Mathematics of Computation)

Thomas Pfahler
Polynomfaktorisierung über endlichen Körpern
(Diplomarbeit 1998)

Anna Pitaev
Entwurf und Implementierung einer Revokationskomponente für ein Java-basiertes Trustcenter
(Diplomarbeit, April 2004)

Thilo Planz
Konzepte für eine sichere Schlüsselverwaltung
(Diplomarbeit, Juni 2002 - Doppelstudium)

Thilo Planz
Entwurf und Implementierung einer Infrastruktur fü ein Java-basiertes Trustcenter
(Diplomarbeit, Januar 2002)

Lea Poeplau
Counting Points on Elliptic Curves
Diplomarbeit, 20. Dezember 2005

Fen Liu, Wen Ji, Lei Hu, Jintai Ding, Shuwang Lv, Andrei Pyshkin, Ralf-Philipp Weinmann
Analysis of the SMS4 block cipher
ACISP 2007, Springer-Verlag (to appear)

E. Tews, R. Weinmann, A. Pyshkin
Breaking 104 bit WEP in less than 60 seconds
In Proceedings of Information Security Applications, 8th International Workshop, WISA 2007,
LNCS volume 4867, pages 188-202, January 2008

Johannes Buchmann, Andrei Pyshkin, Ralf-Philipp Weinmann
A Zero-Dimensional Groebner Basis for AES-128
FSE 2006, LNCS 4047, pp. 78-88, Springer-Verlag, [pdf available through SpringerLink]

Johannes Buchmann, Andrei Pyshkin, Ralf-Philipp Weinmann
Block Ciphers Sensitive to Groebner Basis Attacks
CT-RSA 2006, LNCS 3860, pp. 313-331, Springer-Verlag, [pdf available through SpringerLink]

Andrea Rau
Bestimmung der Anzahl rationaler Punkte elliptischer Kurven über endlichen Körpern der Charakteristik 2
(Diplomarbeit, 20.09.1999)

Katja Rauch
Implementierung von symmetrischen Verschlüsselungsverfahren
(Diplomarbeit)

Adrian Roth
Implementierung von Applikationen für den FINREAD Kartenleser
Bachelorarbeit, Juni 2008

Andreas Roth
Flexible - Eine erweiterbare GUI für den FlexiProvider (Backend)
Bachelorarbeit, September 2007

Bärbel Roth
Pseudozufallszahlengeneratoren in LiSA
(Diplomarbeit 1996)

Maurice Mignotte, Attila Pethö, Ralf Roth
Complete solutions of a family of quartic Thue and index form equations
(submitted to Mathematics of Computation)

Ralf Roth, Thomas Setz
LiPS: a system for distibuted processing on workstations
(SFB 124 - Manual 1993)

Ralf Roth, Thomas Setz
Distributed Processing with LiPS
(ALCOM 93)

Ralf Roth
LiPS Ein System für verteilte Anwendungen
(Diplomarbeit 1992)

Johannes Buchmann, Ralf Roth, Matthias Diehl
LiPS: A System for distributed applications
(unpublished 1991)

Johannes Buchmann, Richard Lindner, Markus Rückert
Explicit hard instances of the shortest vector problem

Markus Rückert
Implementierung und Analyse von gitterbasieren Angriffen auf NTRU
Diplomarbeit, April 2007

A. Wiesmaier, U. Rauchschwalbe, C. Ludwig, M. Ruppert, and J. Buchmann
Intrinsically Legal-For-Trade Objects by Digital Signatures
(local version)
in "Proceedings of Sicherheit 2006"
February 2006

Harald Baier, Markus Ruppert
Interoperable and Flexible Digital Signatures for E-Government and E-Commerce
Technical Report No. TI-6/04, 13.05.2004

Markus Ruppert, Markus Tak
Sicherheitsmanagement durch generische, objektorientierte Modellierung einer TrustCenter Software
Technical Report No. TI-3/01, 20.03.2001

Vlad Coroama, Markus Ruppert, Michael Seipel, Markus Tak
Java-basierte Kryptographie wird interoperabel
Technical Report No. TI-1/01, 20.02.2001

Johannes Buchmann, Markus Ruppert, Markus Tak
FlexiPKI - Realisierung einer flexiblen Public-Key-Infrastruktur
Technical Report No. TI-22/99, 16.12.1999

Tobias Sandner
Signaturverfahren mittels hyperelliptischen Kurven und deren effiziente Implementierung

Vladislav Satanovski
Zentralisierte Konfigurationsverwaltung komplexer IT-Systeme
Diplomarbeit, 25. August 2005

Michael Sauer
Eine Block-Lanczos Implementierung für LiDIA
(Diplomarbeit 1997)

Eric Schank
Probabilistische Beweisverifikation
(Dissertation 1997)

Eric Schank
Zur probabilistischen Berechenbarkeitstheorie
(Diplomarbeit 1991)

Joachim Schaub
Implementierung von public-Key-Kryptosystemen über imaginär-quadratischen Ordnungen
(Diplomarbeit 1999)

Erik Scheid
Ein neuer Algorithmus zur Berechnung der Klassenzahl algebraischer Zahlkörper
(Diplomarbeit 1993)

Hisayoshi Sato, Daniel Schepers, Tsuyoshi Takagi
Exact Analysis of Montgomery Multiplication ( pdf, ps.gz)
Technical Report No. TI-2/04, Mai 2004

O. Schirokauer, D. Weber, T. Denny
Discrete Logarithms: The Effectiveness of the Index Calculus Method
(ANTS 1996)

Johannes Buchmann, Erik Dahmen, Michael Schneider
Merkle tree traversal revisited
2nd International Workshop on Post-Quantum Cryptography - PQCrypto 2008, to appear

Michael Schneider
Improved Authentication Path Computation for Merkle Trees
Diplomarbeit, März 2008

Arthur Schmidt
Zur Lösung von zahlentheoretischen Problemen mit klassischen und Quantencomputern
Dissertation, 08.05.2007

Arthur Schmidt
Quantum Algorithm for Solving the Discrete Logarithm Problem in the Class Group of an Imaginary Quadratic Field and Security Comparison of Current Cryptosystems at the Beginning of Quantum Computer Age
ETRICS 2006, Springer-Verlag, LNCS 2006, 3995, 481-493

Arthur Schmidt, Ulrich Vollmer
Polynomial Time Quantum Algorithm for the Computation of the Unit Group of a Number Field
PDF auf Verlagsseite
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing ACM Press, 2005, 475-480
Mai 2005

J. Buchmann, C. Coronado, M. Döring, D. Engelbert, C. Ludwig, R. Overbeck, A. Schmidt, U. Vollmer, R. Weinmann
Post-Quantum Signatures (link)
Oktober 2004

Arthur Schmidt, Ulrich Vollmer
Polynomial Time Quantum Algorithm for the Computation of the Unit Group of a Number Field
Technical Report No. TI-1/04, Mai 2004

Johannes Buchmann, Arthur Schmidt
Computing the structure of a finite abelian group
Technical Report No. TI-5/03, 12.06.2003 </