Mutant Zhuang-Zi algorithm

Jintai Ding*, Dieter S. Schmidt

*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationPost-Quantum Cryptography - Third International Workshop, PQCrypto 2010, Proceedings
Pages28-40
Number of pages13
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event3rd International Workshop on Post-Quantum Cryptography, PQCrypto 2010 - Darmstadt, Germany
Duration: 25 May 201028 May 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6061 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Post-Quantum Cryptography, PQCrypto 2010
Country/TerritoryGermany
CityDarmstadt
Period25/05/1028/05/10

Keywords

  • Hidden Field Equation
  • multivariate polynomials
  • mutant
  • polynomial roots

Fingerprint

Dive into the research topics of 'Mutant Zhuang-Zi algorithm'. Together they form a unique fingerprint.

Cite this