TU Darmstadt / ULB / TUbiblio

Linear Recurring Sequences for the UOV Key Generation

Petzoldt, Albrecht and Bulygin, Stanislav and Buchmann, Johannes
Catalano, Dario and Fazio, Nelly and Gennaro, Rosario and Nicolosi, Antonio (eds.) (2011):
Linear Recurring Sequences for the UOV Key Generation.
In: Proceedings of PKC 2011, Springer, In: LNCS, [Conference or Workshop Item]

Abstract

Multivariate public key cryptography is one of the main approaches to guarantee the security of communication in the post-quantum world. Due to its high efficiency and modest computational requirements, multivariate cryptography seems especially appropriate for signature schemes on low cost devices. However, multivariate schemes are not yet much used, mainly because of the large size of the public key. In [PB10] Petzoldt et al. presented an idea how to create a multivariate signature scheme with partially cyclic public key based on the UOV scheme of Kipnis and Patarin. In this paper we use their idea to create a signature scheme whose public key is mainly given by a linear recurring sequence (LRS). By doing so, we are able to reduce the size of the public key by up to 86 %. Moreover, we get a public key with good statistical properties.

Item Type: Conference or Workshop Item
Erschienen: 2011
Editors: Catalano, Dario and Fazio, Nelly and Gennaro, Rosario and Nicolosi, Antonio
Creators: Petzoldt, Albrecht and Bulygin, Stanislav and Buchmann, Johannes
Title: Linear Recurring Sequences for the UOV Key Generation
Language: ["languages_typename_1" not defined]
Abstract:

Multivariate public key cryptography is one of the main approaches to guarantee the security of communication in the post-quantum world. Due to its high efficiency and modest computational requirements, multivariate cryptography seems especially appropriate for signature schemes on low cost devices. However, multivariate schemes are not yet much used, mainly because of the large size of the public key. In [PB10] Petzoldt et al. presented an idea how to create a multivariate signature scheme with partially cyclic public key based on the UOV scheme of Kipnis and Patarin. In this paper we use their idea to create a signature scheme whose public key is mainly given by a linear recurring sequence (LRS). By doing so, we are able to reduce the size of the public key by up to 86 %. Moreover, we get a public key with good statistical properties.

Title of Book: Proceedings of PKC 2011
Series Name: LNCS
Number: 6571
Publisher: Springer
Uncontrolled Keywords: Secure Data;Multivariate Cryptography, UOV Signature Scheme, Key Size Reduction, Linear Recurring
Divisions: LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Date Deposited: 30 Dec 2016 20:23
Identification Number: TUD-CS-2011-0016
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item