Skip to main content

Mutant Zhuang-Zi Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6061))

Abstract

In this paper we present a new variant of the Zhuang-Zi algorithm, which solves multivariate polynomial equations over a finite field by converting it into a single variable problem over a large extension field. The improvement is based on the newly developed concept of mutant in solving multivariate equations.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Smith, D.E.: History of Mathematics, vol. 1, 2. Dover, New York (1951-1952)

    Google Scholar 

  2. Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Universität Innsbruck (1965)

    Google Scholar 

  3. Ding, J., Gower, J., Schmidt, D.: Multivariate Public Key Cryptography. In: Advances in Information Security. Springer, Heidelberg (2006)

    Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and intractability. In: A Guide to the theory of NP-completeness. W.H. Freeman, New York (1979)

    Google Scholar 

  5. Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 392–407. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Faugère, J.C.: A new efficient algorithm for computing Gröbner bases (F 4). Journal of Pure and Applied Algebra 139, 61–88 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Faugère, J.C.: A new efficient algorithm for computing Gröbner bases without reduction to zero (F 5). In: International Symposium on Symbolic and Algebraic Computation — ISSAC 2002, July 2002, pp. 75–83. ACM Press, New York (2002)

    Chapter  Google Scholar 

  8. Ding, J.: Mutants and its impact on polynomial solving strategies and algorithms. In: Privately distributed research note, University of Cincinnati and Technical University of Darmstadt, 2006 (2006)

    Google Scholar 

  9. Ding, J., Carbarcas, D., Schmidt, D., Buchmann, J., Mohamed, M.S.E., Mohamed, W.S.A.E., Tohaneanu, S., Weinmann, R.P.: Mutant XL. In: SCC 2008 (2008)

    Google Scholar 

  10. Mohamed, M.S.E., Mohamed, W.S.A.E., Ding, J., Buchmann, J.: MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 203–215. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Mohamed, M.S.E., Cabarcas, D., Ding, J., Buchmann, J., Bulygin, S.: MXL 3: An efficient algorithm for computing Gröbner bases of zero-dimensional ideals. In: The 12th International Conference on Information Security and Cryptology (ICISC 2009), Seoul, Korea, December 2009. LNCS, Springer, Heidelberg (2009)

    Google Scholar 

  12. Ding, J., Gower, J.E., Schmidt, D.: Zhuang-Zi: A new algorithm for solving multivariate polynomial equations over a finite field. In: PQCrypto 2006: International Workshop on Post-Quantum Cryptography, May 23-26. Katholieke Universiteit Leuven, Belgium (2006)

    Google Scholar 

  13. Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature verification and message encryption. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 419–453. Springer, Heidelberg (1988)

    Google Scholar 

  14. Patarin, J.: Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt’88. Designs, Codes and Cryptography 20, 175–209 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19–30. Springer, Heidelberg (1999)

    Google Scholar 

  16. Geddes, K.O., Czapor, S.R., Labahn, G.: Algorithms for Computer Algebra. Kluwer, Amsterdam (1992)

    MATH  Google Scholar 

  17. Lidl, R., Niederreiter, H.: Finite Fields, 2nd edn. Encyclopedia of Mathematics and its Application, vol. 20. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  18. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  19. Computational Algebra Group, University of Sydney: The MAGMA computational algebra system for algebra, number theory and geometry (2005), http://magma.maths.usyd.edu.au/magma/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, J., Schmidt, D.S. (2010). Mutant Zhuang-Zi Algorithm. In: Sendrier, N. (eds) Post-Quantum Cryptography. PQCrypto 2010. Lecture Notes in Computer Science, vol 6061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12929-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12929-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12928-5

  • Online ISBN: 978-3-642-12929-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics