Dahmen, Erik (2009)
Post-quantum signatures for today.
Technische Universität Darmstadt
Ph.D. Thesis, Primary publication
|
PDF
dissertation.dahmen.pdf Copyright Information: CC BY-NC-ND 2.5 Generic - Creative Commons, Attribution, NonCommercial, NoDerivs . Download (627kB) | Preview |
Item Type: | Ph.D. Thesis | ||||
---|---|---|---|---|---|
Type of entry: | Primary publication | ||||
Title: | Post-quantum signatures for today | ||||
Language: | English | ||||
Referees: | Buchmann, Prof. Dr. Johannes ; Ding, Prof. Dr. Jintai | ||||
Date: | 9 February 2009 | ||||
Place of Publication: | Darmstadt | ||||
Date of oral examination: | 5 February 2009 | ||||
Corresponding Links: | |||||
Abstract: | Digital signatures are essential for the security of computer networks such as the Internet. For example, digital signatures are widely used to ensure the authenticity and integrity of updates for operating systems and other software applications. The security of the few practically used signature schemes is threatened by quantum computers. When large quantum computers are built, all currently used signature schemes will become insecure. It is therefore of extreme importance to develop alternative signature schemes that remain secure in the presence of quantum computers and which are able to compete with currently used signature schemes. A very promising candidate for a signature scheme that withstands quantum computer attacks is the Merkle signature scheme invented by Merkle in 1979. However, even combined with the improvements by Szydlo and Coronado, the Merkle signature scheme has certain efficiency drawbacks that keep it from being truly practical. First of all, it has highly unbalanced signature generation times. In the worst case, signature generation takes significantly longer than on average. Secondly, the Merkle--Szydlo--Coronado signature scheme produces very large signatures. It is also unclear if Merkle's signature scheme is suitable for application on resource constrained devices. The generalized Merkle signature scheme (GMSS) presented in this thesis solves the problems mentioned above. It drastically reduces the worst case signature generation time of the Merkle--Szydlo--Coronado signature scheme. The worst case signature generation time of GMSS corresponds to the average case signature generation time of the Merkle--Szydlo--Coronado signature scheme. Further, the worst case signature generation time of GMSS is extremely close to its average case signature generation time and thus, GMSS provides balanced timings for the signature generation. GMSS exploits the improved signature generation times to provide a noticeable reduction of the signature sizes while maintaining timings that are highly competitive to currently used signature schemes. A proof-of-concept implementation shows that GMSS can also be used on resource constrained devices and excellently compares to currently used signature schemes. This thesis also introduces a new construction method for Merkle signatures. This construction is provably secure under weaker security assumptions and yields a signature scheme with a significantly higher security level compared to the original construction. |
||||
Alternative Abstract: |
|
||||
URN: | urn:nbn:de:tuda-tuprints-13196 | ||||
Classification DDC: | 000 Generalities, computers, information > 004 Computer science 500 Science and mathematics > 510 Mathematics |
||||
Divisions: | 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra | ||||
Date Deposited: | 27 Feb 2009 12:47 | ||||
Last Modified: | 08 Jul 2020 23:17 | ||||
URI: | https://tuprints.ulb.tu-darmstadt.de/id/eprint/1319 | ||||
PPN: | 209663065 | ||||
Export: |
View Item |