Permutation Polynomials in RSA-Cryptosystems

From MaRDI portal
Revision as of 11:28, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5019339


DOI10.1007/978-1-4684-4730-9_23zbMath1487.94128MaRDI QIDQ5019339

Rudolf Lidl, Winfried B. Müller

Publication date: 8 January 2022

Published in: Advances in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4684-4730-9_23


94A60: Cryptography

11T06: Polynomials over finite fields


Related Items

More results about a class of quadrinomials over finite fields of odd characteristic, Cyclotomic Mapping Permutation Polynomials over Finite Fields, Permutation polynomials modulo \(2^w\), Large classes of permutation polynomials over \(\mathbb {F}_{q^2}\), Some new classes of permutation trinomials over finite fields with even characteristic, Value sets of Dickson polynomials over finite fields, Permutation polynomials of the form \(L(x) + S_{2k}^a + S_{2k}^b\) over \(\mathbb{F}_{q^{3k}}\), Piecewise constructions of inverses of some permutation polynomials, Exceptional polynomials with 2-transitive affine monodromy groups, Permutation polynomials and applications to coding theory, On permutation polynomials of prescribed shape, Permutation polynomials on matrices, Generalizations of the Fibonacci pseudoprimes test, Further results on permutation polynomials of the form \((x^{p^m}-x+\delta)^s+x\) over \(\mathbb{F}_{p^{2m}}\), Compositional inverses of permutation polynomials of the form \(x^rh(x^s)\) over finite fields, New constructions of involutions over finite fields, Further results on permutation polynomials over finite fields, Classification of permutation trinomials and quadrinomials over prime fields, Several new permutation quadrinomials over finite fields of odd characteristic, Determination of a type of permutation binomials and trinomials, Algebraic generalization of Diffie-Hellman key exchange, A recursive construction of permutation polynomials over \(\mathbb F_{q^2}\) with odd characteristic related to Rédei functions, Polynomial representations of the Lucas logarithm



Cites Work