Research Group of Prof.C.P.Schnorr, University of Frankfurt am Main
Copyright Note
The documents contained in these directories are included by the
contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a non-commercial basis. Copyright and
all rights therein are maintained by the authors or by other copyright
holders, notwithstanding that they have offered their works here
electronically. It is understood that all persons copying this
information will adhere to the terms and constraints invoked by each
author's copyright. These works may not be reposted without the
explicit permission of the copyright holder.
-
Das Faktorisierungsrepräsentationsproblem als Basis kryptographischer Protokolle
Roger Fischlin, Ph.D. Thesis (Mathematics), 2002.
-
Trapdoor Commitment Schemes and Their Applications (Abstract)
Marc Fischlin, Ph.D. Thesis (Mathematics), 2001.
-
Komplexitäat von Gitterproblemen:
Nicht-Approximierbarkeit und Grenzen der Nicht-Approximierbarkeit
Jean-Pierre Seifert, Ph.D. Thesis (Mathematics), 2000.
-
Effiziente Signaturerzeugung durch Server-Unterstützung und Vorberechnung
Johannes Merkle, Ph.D. Thesis (Mathematics), 2000.
-
Das SAT-Problem: Ein systematischer Zugang zu effizienten Algorithmen für das
ausssagenlogische Erfüllbarkeitsproblem ausgehend von neuen Instrumenten
der Worst-Case-Analyse
Oliver Kullmann, Ph.D. Thesis (Mathematics), 1997.
-
Aufzählung von kurzen Gittervektoren in allgemeiner Norm
Harald Ritter, Ph.D. Thesis (Mathematics), 1997.
-
Kettenbruchentwicklung in beliebiger Dimension, Stabilität und Approximation
Carsten Rössner, Ph.D. Thesis (Mathematics), 1996.
-
Gitterbasenreduktion für beliebige Normen
Michael Kaib, Ph.D. Thesis (Mathematics), 1994.