Solvability of a System of Bivariate Polynomial Equations over a Finite Field

2005 ◽  
pp. 551-562 ◽  
Author(s):  
Neeraj Kayal
Keyword(s):  
Finite Field ◽  
Polynomial Equations ◽  
Bivariate Polynomial

Quantum computing and polynomial equations over Z_2

2005 ◽  
Vol 5 (2) ◽  
pp. 102-112
Author(s):  
C.M. Dawson ◽  
H.L. Haselgrove ◽  
A.P. Hines ◽  
D. Mortimer ◽  
M.A. Nielsen ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Finite Field ◽  
Quantum Computation ◽  
Quantum Computer ◽  
Complexity Classes ◽  
Polynomial Equations ◽  
Computational Power ◽  
Number Of Solutions

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z_2. This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes, namely BQP/P/\#P and BQP/PP.

scholarly journals Polynomial representations of the Diffie-Hellman mapping

2001 ◽  
Vol 63 (3) ◽  
pp. 467-473 ◽  
Author(s):  
Edwin El Mahassni ◽  
Igor Shparlinski
Keyword(s):  
Finite Field ◽  
Lower Bounds ◽  
Primitive Root ◽  
Polynomial Equations ◽  
Arithmetic Complexity ◽  
Diffie Hellman ◽  
Polynomial Representations ◽  
Parallel Arithmetic

We obtain lower bounds on the degrees of polynomials representing the Diffie-Hellman mapping (gx, gy) → gxy, where g is a primitive root of a finite field q of q elements. These bounds are exponential in terms of log q. In particular, these results can be used to obtain lower bounds on the parallel arithmetic complexity of breaking the Diffie-Hellman cryptosystem. The method is based on bounds of numbers of solutions of some polynomial equations.

scholarly journals Finding roots in with the successive resultants algorithm

2014 ◽  
Vol 17 (A) ◽  
pp. 203-217 ◽  
Author(s):  
Christophe Petit
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Finite Fields ◽  
Coding Theory ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Polynomial Equations ◽  
Preliminary Results ◽  
Characteristic Case ◽  
Practical Security

AbstractThe problem of solving polynomial equations over finite fields has many applications in cryptography and coding theory. In this paper, we consider polynomial equations over a ‘large’ finite field with a ‘small’ characteristic. We introduce a new algorithm for solving this type of equations, called the successive resultants algorithm (SRA). SRA is radically different from previous algorithms for this problem, yet it is conceptually simple. A straightforward implementation using Magma was able to beat the built-in Roots function for some parameters. These preliminary results encourage a more detailed study of SRA and its applications. Moreover, we point out that an extension of SRA to the multivariate case would have an important impact on the practical security of the elliptic curve discrete logarithm problem in the small characteristic case.Supplementary materials are available with this article.

On the Number of Zeros Over a Finite Field of Certain Symmetric Polynomials

1980 ◽  
Vol 23 (3) ◽  
pp. 327-332
Author(s):  
P. V. Ceccherini ◽  
J. W. P. Hirschfeld
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Polynomial Equations ◽  
Symmetric Polynomials ◽  
Number Of Solutions ◽  
Number Of Zeros

A variety of applications depend on the number of solutions of polynomial equations over finite fields. Here the usual situation is reversed and we show how to use geometrical methods to estimate the number of solutions of a non-homogeneous symmetric equation in three variables.

scholarly journals Polynomial equations for matrices over finite fields

1999 ◽  
Vol 59 (1) ◽  
pp. 59-64 ◽  
Author(s):  
Jiuzhao Hua
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Monic Polynomial ◽  
Polynomial Equations

Let E(x) be a monic polynomial over the finite field q of q elements. A formula for the number of n × n matrices θ over q, satisfying E(θ) = 0 is obtained by counting the representations of the algebra q[x]/(E(x)) of degree n. This simplifies a formula of Hodges.

scholarly journals PERMUTATION POLYNOMIALS OF DEGREE 8 OVER FINITE FIELDS OF ODD CHARACTERISTIC

2019 ◽  
Vol 101 (1) ◽  
pp. 40-55 ◽  
Author(s):  
XIANG FAN
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Computer Algebra ◽  
Personal Computer ◽  
Computer Algebra System ◽  
Computer Work ◽  
Permutation Polynomials ◽  
Polynomial Equations ◽  
Manual Analysis ◽  
Odd Order

We give an algorithmic generalisation of Dickson’s method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson’s idea is to formulate from Hermite’s criterion several polynomial equations satisfied by the coefficients of an arbitrary PP of degree $d$. Previous classifications of PPs of degree at most 6 were essentially deduced from manual analysis of these polynomial equations, but this approach is no longer viable for $d>6$. Our idea is to calculate some radicals of ideals generated by the polynomials, implemented by a computer algebra system. Our algorithms running in SageMath 8.6 on a personal computer work very fast to determine all PPs of degree 8 over an arbitrary finite field of odd order $q>8$. Such PPs exist if and only if $q\in \{11,13,19,23,27,29,31\}$ and are explicitly listed in normalised form.

Sign in / Sign up

Export Citation Format

Share Document