Linear Recurring Sequences for the UOV Key Generation

  • Albrecht Petzoldt
  • Stanislav Bulygin
  • Johannes Buchmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6571)

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 much used yet, mainly because of the large size of their public keys. In [PB10] Petzoldt et al. presented an idea how to create a multivariate signature scheme with a partially cyclic public key based on the UOV scheme of Kipnis and Patarin [KP99]. In this paper we use their idea to create a multivariate 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.

Keywords

Multivariate Cryptography UOV Signature Scheme Key Size Reduction Linear Recurring Sequences 

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Albrecht Petzoldt
    • 1
    • 2
  • Stanislav Bulygin
    • 1
    • 2
  • Johannes Buchmann
    • 1
    • 2
  1. 1.Department of Computer ScienceTechnische Universität DarmstadtDarmstadtGermany
  2. 2.Center for Advanced Security Research Darmstadt - CASEDDarmstadtGermany

Personalised recommendations