Abstract
Let Fq be a finite field with q elements, ƒ ∈ Fq(x) a rational function over Fq, and D ⊆ Fq the domain of definition of ƒ. Consider three notions of "permutation functions": ƒ is a permutation on Fq, or on D, or ƒ is injective on D. For each of these, a random polynomial-time test is presented. For the image size of an arbitrary rational function, a fully polynomial-time randomized approximation scheme is given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
