Constructing permutation rational functions from isogenies

From MaRDI portal
Publication:3176494




Abstract: A permutation rational function finmathbbFq(x) is a rational function that induces a bijection on mathbbFq, that is, for all yinmathbbFq there exists exactly one xinmathbbFq such that f(x)=y. Permutation rational functions are intimately related to exceptional rational functions, and more generally exceptional covers of the projective line, of which they form the first important example. In this paper, we show how to efficiently generate many permutation rational functions over large finite fields using isogenies of elliptic curves, and discuss some cryptographic applications. Our algorithm is based on Fried's modular interpretation of certain dihedral exceptional covers of the projective line (Cont. Math., 1994).





Describes a project that uses

Uses Software





This page was built for publication: Constructing permutation rational functions from isogenies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176494)