Linear Recurring Sequences for the UOV Key Generation Revisited
Multivariate cryptography is one of the main candidates to guarantee the security of communication in a post quantum era. While multivariate signature schemes are very fast and require only modest computational resources, the key sizes of such schemes are quite large. In  Petzoldt et al. proposed a way to use Linear Recurring Sequences (LRS’s) for the key generation of the Unbalanced Oil and Vinegar (UOV) signature scheme by which they were able to reduce the public key size of this scheme by a factor of 7. In this paper we describe a modification of their scheme, which enables us not only to reduce the public key size, but also to speed up the verification process of the UOV scheme by a factor of 5.
KeywordsMultivariate Cryptography UOV Signature Scheme Key Size Reduction Fast Verification
Unable to display preview. Download preview PDF.
- Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)Google Scholar
- Lidl, R., Niederreiter, H.: Introduction to Finite Fields and their Applications. Cambridge University Press (1986)Google Scholar
- Patarin, J.: The oil and vinegar signature scheme. Presented at the Dagstuhl Workshop on Cryptography (September 1997)Google Scholar
- Petzoldt, A., Bulygin, S., Buchmann, J.: A Multivariate Signature Scheme with a partially cyclic public key. In: Proceedings of SCC 2010, pp. 229–235 (2010)Google Scholar
- Shor, P.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 26(5), 1484–1509Google Scholar