Mutant Zhuang-Zi algorithm

Jintai Ding; Dieter S. Schmidt

doi:10.1007/978-3-642-12929-2_3

Mutant Zhuang-Zi algorithm

Jintai Ding^*, Dieter S. Schmidt

^*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-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 language	English
Title of host publication	Post-Quantum Cryptography - Third International Workshop, PQCrypto 2010, Proceedings
Pages	28-40
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-642-12929-2_3
Publication status	Published - 2010
Externally published	Yes
Event	3rd International Workshop on Post-Quantum Cryptography, PQCrypto 2010 - Darmstadt, Germany Duration: 25 May 2010 → 28 May 2010

Publication series

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

Conference

Conference	3rd International Workshop on Post-Quantum Cryptography, PQCrypto 2010
Country/Territory	Germany
City	Darmstadt
Period	25/05/10 → 28/05/10

Keywords

Hidden Field Equation
multivariate polynomials
mutant
polynomial roots

Access to Document

10.1007/978-3-642-12929-2_3

Cite this

Ding, J., & Schmidt, D. S. (2010). Mutant Zhuang-Zi algorithm. In Post-Quantum Cryptography - Third International Workshop, PQCrypto 2010, Proceedings (pp. 28-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6061 LNCS). https://doi.org/10.1007/978-3-642-12929-2_3

@inproceedings{7c5e152912594329931fb77a7c097f37,

title = "Mutant Zhuang-Zi algorithm",

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.",

keywords = "Hidden Field Equation, multivariate polynomials, mutant, polynomial roots",

author = "Jintai Ding and Schmidt, {Dieter S.}",

year = "2010",

doi = "10.1007/978-3-642-12929-2_3",

language = "English",

isbn = "3642129285",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "28--40",

booktitle = "Post-Quantum Cryptography - Third International Workshop, PQCrypto 2010, Proceedings",

note = "3rd International Workshop on Post-Quantum Cryptography, PQCrypto 2010 ; Conference date: 25-05-2010 Through 28-05-2010",

}

Ding, J & Schmidt, DS 2010, Mutant Zhuang-Zi algorithm. in Post-Quantum Cryptography - Third International Workshop, PQCrypto 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6061 LNCS, pp. 28-40, 3rd International Workshop on Post-Quantum Cryptography, PQCrypto 2010, Darmstadt, Germany, 25/05/10. https://doi.org/10.1007/978-3-642-12929-2_3

Mutant Zhuang-Zi algorithm. / Ding, Jintai; Schmidt, Dieter S.
Post-Quantum Cryptography - Third International Workshop, PQCrypto 2010, Proceedings. 2010. p. 28-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6061 LNCS).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

T1 - Mutant Zhuang-Zi algorithm

AU - Ding, Jintai

AU - Schmidt, Dieter S.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Hidden Field Equation

KW - multivariate polynomials

KW - mutant

KW - polynomial roots

UR - http://www.scopus.com/inward/record.url?scp=77954393639&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12929-2_3

DO - 10.1007/978-3-642-12929-2_3

M3 - Conference Proceeding

AN - SCOPUS:77954393639

SN - 3642129285

SN - 9783642129285

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

SP - 28

EP - 40

BT - Post-Quantum Cryptography - Third International Workshop, PQCrypto 2010, Proceedings

T2 - 3rd International Workshop on Post-Quantum Cryptography, PQCrypto 2010

Y2 - 25 May 2010 through 28 May 2010

ER -

Mutant Zhuang-Zi algorithm

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this