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
Article
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.
| Item Type: | Article |
|---|---|
| Erschienen: | 2012 |
| Creators: | Bansarkhani, Rachid El ; Cabarcas, Daniel ; Kuo, Po-Chun ; Schmidt, Patrick ; Schneider, Michael |
| Type of entry: | Bibliographie |
| Title: | A Selection of Recent lattice-Based Signature and Encryption Schemes |
| Language: | ["languages_typename_1" not defined] |
| Date: | December 2012 |
| Journal or Publication Title: | Tatra Mountains Mathematical Publications |
| Volume of the journal: | 53 |
| Event Location: | Bratislava Slovensko |
| 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. |
| Uncontrolled Keywords: | Secure Data;lattice-based cryptography, signatures, encryption |
| Identification Number: | TUD-CS-2013-0040 |
| Divisions: | 20 Department of Computer Science 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra Profile Areas Profile Areas > Cybersecurity (CYSEC) LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt |
| Date Deposited: | 04 Aug 2016 15:08 |
| Last Modified: | 23 Jul 2021 15:49 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum