TU Darmstadt / ULB / TUbiblio

A Selection of Recent lattice-Based Signature and Encryption Schemes

Bansarkhani, Rachid El ; Cabarcas, Daniel ; Kuo, Po-Chun ; Schmidt, Patrick ; Schneider, Michael (2012)
A Selection of Recent lattice-Based Signature and Encryption Schemes.
In: Tatra Mountains Mathematical Publications, 53
Artikel, Bibliographie

Kurzbeschreibung (Abstract)

It is known that the development of quantum computers will break the cryptographic schemes that are in use today. Since Shor’s algorithm is able to solve the factoring and discrete logarithm problems, all cryptographic systems based on these two problems will get broken in the presence of large-scale quantum computers. Lattice-based schemes, however, are considered secure against attacks with these new machines. In this paper we present an overview of lattice-based cryptosystems, showing the most recent and the most promising candidates for encryption and signatures based on lattice problems. We explain the advantages and disadvantages of the cryptographic schemes. We also adjoin details about zero knowledge identification. With this work we try to give insight to one of the most promising candidates of future cryptography, for the time when potential quantum computers exist. We also point out drawbacks of these systems, which discloses directions for future work in lattice-based cryptography.

Typ des Eintrags: Artikel
Erschienen: 2012
Autor(en): Bansarkhani, Rachid El ; Cabarcas, Daniel ; Kuo, Po-Chun ; Schmidt, Patrick ; Schneider, Michael
Art des Eintrags: Bibliographie
Titel: A Selection of Recent lattice-Based Signature and Encryption Schemes
Sprache: Englisch
Publikationsjahr: Dezember 2012
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Tatra Mountains Mathematical Publications
Jahrgang/Volume einer Zeitschrift: 53
Veranstaltungsort: Bratislava Slovensko
Kurzbeschreibung (Abstract):

It is known that the development of quantum computers will break the cryptographic schemes that are in use today. Since Shor’s algorithm is able to solve the factoring and discrete logarithm problems, all cryptographic systems based on these two problems will get broken in the presence of large-scale quantum computers. Lattice-based schemes, however, are considered secure against attacks with these new machines. In this paper we present an overview of lattice-based cryptosystems, showing the most recent and the most promising candidates for encryption and signatures based on lattice problems. We explain the advantages and disadvantages of the cryptographic schemes. We also adjoin details about zero knowledge identification. With this work we try to give insight to one of the most promising candidates of future cryptography, for the time when potential quantum computers exist. We also point out drawbacks of these systems, which discloses directions for future work in lattice-based cryptography.

Freie Schlagworte: Secure Data;lattice-based cryptography, signatures, encryption
ID-Nummer: TUD-CS-2013-0040
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik
20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra
Profilbereiche
Profilbereiche > Cybersicherheit (CYSEC)
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Hinterlegungsdatum: 04 Aug 2016 15:08
Letzte Änderung: 23 Jul 2021 15:49
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen