Linear recurring sequences for the UOV key generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6571 LNCS, Issue , 2011, Pages 335-350

  Petzoldt, Albrecht ^a,b   Bulygin, Stanislav ^a,b   Buchmann, Johannes ^a,b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b Research Darmstadt CASED   (Germany)

Author keywords

Key Size Reduction; Linear Recurring Sequences; Multivariate Cryptography; UOV Signature Scheme

Indexed keywords

COMPUTATIONAL REQUIREMENTS; HIGH EFFICIENCY; KEY GENERATION; KEY SIZES; LARGE SIZES; LINEAR RECURRING SEQUENCE; LOW-COST DEVICES; MULTIVARIATE CRYPTOGRAPHY; MULTIVARIATE SCHEMES; PUBLIC KEYS; QUANTUM WORLD; SIGNATURE SCHEME; STATISTICAL PROPERTIES; UOV SIGNATURE SCHEME;

COMPUTATIONAL EFFICIENCY; PUBLIC KEY CRYPTOGRAPHY; SIZE DETERMINATION;

AUTHENTICATION;

EID: 79952493422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19379-8_21     Document Type: Conference Paper

References (18)

1. Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): Post-Quantum Cryptography. Springer, Heidelberg (2009)
2. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4), 235-265 (1997) (Pubitemid 127167874)
3. Bettale, L., Fauǵere, J.C., Perret, L.: Hybrid approach for solving multivariate systems over finite fields. Journal Math. Crypt. 2, 1-22 (2008)
4. [BP10] Bulygin, S., Petzoldt, A., Buchmann, J.: Towards provable security of the UOV Signature Scheme under direct attacks. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol. 6498, pp. 17-32. Springer, Heidelberg (2010)
5. [CC08] Chen, A.I.-T., Chen, C.-H.O., Chen, M.-S., Cheng, C.M., Yang, B.-Y.: Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and ICDerivatives. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 95-108. Springer, Heidelberg (2008)
6. Ding, J., Gower, J.E., Schmidt, D.: Multivariate Public Key Cryptosystems. Springer, Heidelberg (2006)
7. Fauǵere, J.C.: A new efficient algorithm for computing Groebner bases (F4). Journal of Pure and Applied Algebra 139, 61-88 (1999)
8. Fauǵere, J.C., Perret, L.: An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography. Journal of Symbolic Computation 44(12), 1676-1689 (2009)
9. Golomb, S.W.: Shift Register Sequences. Holden Day, San Francisco (1967)
10. Golomb, S.W., Gong, G.: Signal Design for Good Correlation. Cambridge University Press, New York (2005)
11. Hu, Y.-H., Wang, L.-C., Chou, C.-Y., Lai, F.: Similar Keys of Multivariate Quadratic Public Key Cryptosystems. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol. 3810, pp. 211-222. Springer, Heidelberg (2005) (Pubitemid 43829605)
12. Kipnis, A., Patarin, J., Goubin, L.: Unbalanced Oil and Vinegar Signature Schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 206-222. Springer, Heidelberg (1999)
13. Kipnis, A., Shamir, A.: Cryptanalysis of the Oil & Vinegar Signature Scheme. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 257-266. Springer, Heidelberg (1998) (Pubitemid 128119010)
14. Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge University Press, Cambridge (1986)
15. Patarin, J.: The oil and vinegar signature scheme, presented at the Dagstuhl Workshop on Cryptography (September 1997)
16. Petzoldt, A., Bulygin, S., Buchmann, J.: A Multivariate Signature Scheme with a partially cyclic public key. In: Proceedings of SCC, pp. 229-235 (2010)
17. Shor, P.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput. 26(5), 1484-1509
18. Yang, B.-Y., Chen, J.-M.: Building secure tame-like multivariate publickey cryptosystems: The new TTS. In: Boyd, C., Gonźalez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 518-531. Springer, Heidelberg (2005) (Pubitemid 41431807)