qTESLA

• Nina Bindel (principal submitter) – Technische Universität Darmstadt, Germany
• Sedat Akleylek – Ondokuz Mayis University, Turkey
• Erdem Alkim – Ege University, Turkey
• Paulo S. L. M. Barreto – University of Washington Tacoma, USA
• Johannes Buchmann – Technische Universität Darmstadt, Germany
• Edward Eaton – ISARA Corporation, Canada
• Gus Gutoski – ISARA Corporation, Canada
• Juliane Krämer – Technische Universität Darmstadt, Germany
• Patrick Longa - Microsoft Research, USA
• Harun Polat – Technische Universität Darmstadt, Germany
• Jefferson E. Ricardini – University of São Paulo, Brazil
• Gustavo Zanon – University of São Paulo, Brazil

Why qTESLA?

qTESLA is distinguished from other lattice-based signature schemes by its strong theoretical security guarantee. The security reduction from the underlying hard problem is tight, meaning that an adversary who can break the signature scheme with a reasonable chance of success must also be able to solve the underlying hard problem with that same chance of success. (Then, since the underlying problem is hard, breaking the signature scheme must also be hard.) Moreover, the security reduction holds in the quantum random oracle model, meaning that qTESLA remains secure even when the adversary uses the scheme’s hash function on a quantum superposition of inputs.

ISARA’s Contribution

Researchers at ISARA played a leading role in the proof of TESLA’s strong theoretical security guarantee and is the basis for qTESLA. The fruits of this research on TESLA were published in the proceedings of the PQCrypto 2017 conference in Utrecht, the Netherlands. Read the published research. ISARA played a supporting role in drafting the qTESLA NIST submission.

Learn more

The official qTESLA web page is maintained by our colleagues in Darmstadt, Germany. Visit the official qTESLA web page.

Wed Jun 17, 2020