Efficient inversion of rational maps over finite fields

MaRDI QIDQ5447283zbMATH OpenFDO

Authors Antonio Cafure, Guillermo Matera, Ariel Waissbein

Publication date 6 March 2008

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Rational and birational maps (14E05) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational aspects in algebraic geometry (14Q99) Toeplitz operators, Hankel operators, Wiener-Hopf operators (47B35) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Piecewise constructions of inverses of cyclotomic mapping permutation polynomials
• Constructing permutation rational functions from isogenies
• On inverses of permutation polynomials of the form \(x(x^s-a)^{(q^m-1)/s}\) over \(\mathbb{F}_{q^n}\)
• Compositional inverses of permutation polynomials of the form x^rh(x^s) over finite fields
• An application of the method of additive chains to inversion in finite fields

Cited in

(2)

• A combinatorial model for reversible rational maps over finite fields
• Rational QR-iteration without inversion

Describes a project that uses

Uses Software

• ISOLATE

This page was built for publication: Efficient inversion of rational maps over finite fields

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