Chebyshev polynomials and a refinement of the local residue/non-residue structure at a prime
Kok Seng Chua

TL;DR
This paper explores Chebyshev polynomials' properties and introduces a refined local residue/non-residue structure at a prime, extending classical number theory concepts and primality criteria using Chebyshev functions.
Contribution
It presents a Chebyshev-based refinement of residue classification at primes and develops analogues of primality tests and cryptographic protocols based on these polynomials.
Findings
Refined local partition of residue classes using quadratic characters
Chebyshev version of Euler's primality criterion involving quadratic characters
Potential extensions to pseudoprimes, Wieferich primes, and cryptographic protocols
Abstract
The basic power function is in some sense a classical limit for large , of the monictised Chebyshev polynomial of the first kind . A theorem of Ritt says they are the only two families of polynomials over which satisfies the commutativity relation . The commutativity is the reason why the RSA scheme allow also digital signature but the Diffie-Hellman key exchange protocol depends only on the commutativity. The DH scheme and many results in elementary local (at a fixed prime) multiplicative number theory is about properties of the power function and they have natural analogue extension to . Recently we discovered a Chebyshev version of Euler's primality criterion , which however depends on two quadratic characters and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Analytic Number Theory Research · Coding theory and cryptography
