Permutation polynomials and a new public-key encryption (Q516791): Difference between revisions

The authors describe an algorithm for finding the compositional inverse for a certain linearized permutation \(P(x) = \sum_{u=0}^na_ux^{2^u}\) of \(\mathrm{GF}(2^n)\). Based on permutation polynomials of this form the authors propose a public key cryptosystem, with \(P(x)\) as (a part of the) public key, and a primitive representation polynomial of \(\mathrm{GF}(2^n)\), \(g(x)\), as the private key.