Cryptography-based security solutions heavily rely on cryptographic primitives such as encryption and signature schemes. However, existing primitives are threatened by attacks which are made possible by new computing architectures and algorithms. Also, new cryptographic solutions require efficient primitives with new functionalities such as fully homomorphic encryption. Thus, the goal of this project area is the development of the required cryptographic primitives. They must be efficient in present and future computing environments, and must resist novel attacks due to new hardware platforms and algorithmic advances.

P1 - Future Public-Key Encryption and Signature Schemes

The goal of the project is to provide practical and secure lattice-based public-key encryption and signature schemes secure against quantum adversaries and providing advanced functionality such as fully homomorphism. It will (1) assess the hardness of certain lattice problems on current and forthcoming parallel architectures and (2) design, study and optimize provably secure lattice-based schemes that are appropriate for new and next-generation computing environments.


Nina Bindel

Kryptographie und Computeralgebra


  • Lattice-based cryptography, in particular lattice-based signatures.
  • Provable security

Nabil Alkeilani Alkadri

Kryptographie und Computeralgebra


  • Lattice-based public-key cryptography
  • Designing and improving lattice-based schemes

 Dr. Rachid El Bansarkhani

Kryptographie und Computeralgebra


  • Post-Quantum, Lattice-based and Code-based Cryptography.
  • Sensor Networks.
  • Stochastic Analysis & Stochastic Differential Equations

Dr. Florian Göpfert

Kryptographie und Computeralgebra


  • Lattice-based public-key encryption.
  • Cryptanalysis of lattices.
  • Optimized parameter selection for lattice-based schemes

Dr. Juliane Krämer

Kryptographie und Computeralgebra


  • Post-quantum cryptography, especially lattice-based cryptography
  • Fault Attacks
  • Side Channel Attacks.

Thomas Wunderer

Kryptographie und Computeralgebra


  • Lattice-Based Cryptography.
  • Hardness of Lattice Problems.

Dr. Artur Mariano

Scientific Computing


  • High performance low TDP Computing.
  • (Accelerated) parallel computing.
  • Performance modeling of parallel hardware.

CROSSING Publications P1

Additional Attributes


HardIDX: Practical and Secure Index with SGX

Benny Fuhry, Raad Bahmani, Ferdinand Brasser, Florian Hahn, Florian Kerschbaum, Ahmad-Reza Sadeghi
In: Conference on Data and Applications Security and Privacy (DBSec), July 2017

A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE

Florian Göpfert, Christine van Vredendaal, Thomas Wunderer
In: PQCrypto 2017 - Eighth International Conference on Post-Quantum Cryptography, June 2017

Estimation of the Hardness of the Learning with Errors Problem with a Given Number of Samples

Markus Schmidt
February 2017
[Thesis (Master, Bachelor, Diploma)]

SFB 1119 - Contact

Contact P1

Johannes Buchmann
TU Darmstadt
Fachbereich Informatik
Theoretische Informatik - Kryptographie und Computeralgebra
Hochschulstraße 10
64289 Darmstadt

Christian Bischof   
TU Darmstadt
Fachbereich Informatik
Scientific Computing
Mornewegstr. 30
64283 Darmstadt


Funded by

A A A | Drucken Print | Impressum Impressum | Sitemap Sitemap | Kontakt Contact | Website Analysis: More Information
zum Seitenanfangzum Seitenanfang