Petzoldt, Albrecht ; Thomae, Enrico ; Bulygin, Stanislav ; Wolf, Christopher
eds.: Preneel, Bart ; Takagi, Tsuyoshi (2011)
Small Public Keys and Fast Verification for Multivariate Quadratic Public Key Systems.
Conference or Workshop Item, Bibliographie
Abstract
Security of public key schemes in a post-quantum world is a challenging task as both RSA and ECC will be broken then. In this paper, we show how post-quantum signature systems based on Multivariate Quadratic (MQ) polynomials can be improved up by about 9/10, and 3/4, respectively, in terms of public key size and verification time. The exact figures are 88% and 73%. This is particularly important for small-scale devices with restricted energy, memory, or computational power. In addition, we show that this reduction does not affect security and that it is also optimal in terms of possible attacks. We do so by combining the priory unrelated concepts of reduced and equivalent keys. Our new scheme is based on the so-called Unbalanced Oil and Vinegar class of MQ-schemes. We have derived our results mathematically and verified the speed-ups through a C++ implementation.
| Item Type: | Conference or Workshop Item |
|---|---|
| Erschienen: | 2011 |
| Editors: | Preneel, Bart ; Takagi, Tsuyoshi |
| Creators: | Petzoldt, Albrecht ; Thomae, Enrico ; Bulygin, Stanislav ; Wolf, Christopher |
| Type of entry: | Bibliographie |
| Title: | Small Public Keys and Fast Verification for Multivariate Quadratic Public Key Systems |
| Language: | English |
| Date: | September 2011 |
| Publisher: | Springer |
| Book Title: | Proceedings of "Workshop on Cryptographic Hardware and Embedded Systems 2011 (CHES 2011)" |
| Series: | Lecture Notes in Computer Science |
| Series Volume: | 6917 |
| Abstract: | Security of public key schemes in a post-quantum world is a challenging task as both RSA and ECC will be broken then. In this paper, we show how post-quantum signature systems based on Multivariate Quadratic (MQ) polynomials can be improved up by about 9/10, and 3/4, respectively, in terms of public key size and verification time. The exact figures are 88% and 73%. This is particularly important for small-scale devices with restricted energy, memory, or computational power. In addition, we show that this reduction does not affect security and that it is also optimal in terms of possible attacks. We do so by combining the priory unrelated concepts of reduced and equivalent keys. Our new scheme is based on the so-called Unbalanced Oil and Vinegar class of MQ-schemes. We have derived our results mathematically and verified the speed-ups through a C++ implementation. |
| Uncontrolled Keywords: | Secure Data;Multivariate Quadratic Cryptography, Post-Quantum Cryptography, Implementation, Unbalanced Oil and Vinegar Signature Scheme |
| Identification Number: | TUD-CS-2011-0160 |
| Divisions: | 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra > Post-Quantum Cryptography LOEWE > LOEWE-Zentren 20 Department of Computer Science LOEWE |
| Date Deposited: | 30 Dec 2016 20:23 |
| Last Modified: | 17 May 2018 13:02 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum