.png){kind=icon}
.png){kind=icon}
Return
Pseudo-Chebyshev Functions Over Finite Fields
.png){kind=icon}
PRE
AI
L
P
N
DOI：10.1109/OJCAS.2026.3687716.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce the notion of pseudo-Chebyshev functions over finite fields. In brief, such functions correspond to a generalization of the n-th Chebyshev polynomial, where n is not restricted to integer values, but can take on any rational value. Our approach is mainly based on concepts of trigonometry over finite fields. Besides defining the referred functions, we derive several of their properties and establish necessary and sufficient conditions for them to permute the elements of F-q. Potential applications of the proposed functions are preliminarily discussed.
Keywords:
Circuits and systems
Filtering
Filters
Circuits
Band-pass filters
Active filters
Integrated circuits
System-on-chip
Power filters
Pixel
Chebyshev polynomials
cryptography
finite fields
permutation
public-key
security
Journal
I
IF:
2.4
Papers:
4.5K
Citations:
387
Organization
Cited Papers