Public quadratic polynomial-tuples for efficient signature-verification and message-encryption
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Algorithms for computer algebra
Algorithms for computer algebra
Cryptanalysis of the Matsumoto and Imai Public Key Schemeof Eurocrypt‘98
Designs, Codes and Cryptography
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Modern Computer Algebra
Multivariate Public Key Cryptosystems (Advances in Information Security)
Multivariate Public Key Cryptosystems (Advances in Information Security)
MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
MXL3: an efficient algorithm for computing gröbner bases of zero-dimensional ideals
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
| Hi-index | 0.00 |
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.