TU Darmstadt / ULB / TUbiblio

Linear Recurring Sequences for the UOV Key Generation

Petzoldt, Albrecht ; Bulygin, Stanislav ; Buchmann, Johannes
Hrsg.: Catalano, Dario ; Fazio, Nelly ; Gennaro, Rosario ; Nicolosi, Antonio (2011)
Linear Recurring Sequences for the UOV Key Generation.
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (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.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2011
Herausgeber: Catalano, Dario ; Fazio, Nelly ; Gennaro, Rosario ; Nicolosi, Antonio
Autor(en): Petzoldt, Albrecht ; Bulygin, Stanislav ; Buchmann, Johannes
Art des Eintrags: Bibliographie
Titel: Linear Recurring Sequences for the UOV Key Generation
Sprache: Englisch
Publikationsjahr: März 2011
Verlag: Springer
(Heft-)Nummer: 6571
Buchtitel: Proceedings of PKC 2011
Reihe: LNCS
Kurzbeschreibung (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.

Freie Schlagworte: Secure Data;Multivariate Cryptography, UOV Signature Scheme, Key Size Reduction, Linear Recurring
ID-Nummer: TUD-CS-2011-0016
Fachbereich(e)/-gebiet(e): LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra
LOEWE > LOEWE-Zentren
20 Fachbereich Informatik
LOEWE
Hinterlegungsdatum: 30 Dez 2016 20:23
Letzte Änderung: 17 Mai 2018 13:02
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