Solving the Quadratic Congruence Equation Module a Prime Number p
Baoan Guo, Xiaodong Zhou, Kai-cheng Lu
Abstract
Baoan Guo, Xiaodong Zhou, Kai-cheng Lu
Abstract
It is very important to solve the quadratic congruence equation over a finite field GF(p) in cryptography. In this paper we discussed the graphic structure of the quadratic roots module, a prime number p . A deterministic polynomial algorithm is presented to detect the quadratic roots if a quadratic non-residue is provided no matter what kind of the prime number p is. Some examples are given in the end of the paper.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is very important to solve the quadratic congruence equation over a finite field GF(p) in cryptography. In this paper we discussed the graphic structure of the quadratic roots module, a prime number p . A deterministic polynomial algorithm is presented to detect the quadratic roots if a quadratic non-residue is provided no matter what kind of the prime number p is. Some examples are given in the end of the paper.
Key concepts: Quadratic residue, Congruence (geometry), Legendre symbol, Quadratic equation, Mathematics, Prime (order theory), Quadratic field, Binary quadratic form