Permutation polynomials and a new public-key encryption (Q516791): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q439080 |
||
Property / author | |||
Property / author: Melsik K. Kyureghyan / rank | |||
Revision as of 20:41, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Permutation polynomials and a new public-key encryption |
scientific article |
Statements
Permutation polynomials and a new public-key encryption (English)
0 references
15 March 2017
0 references
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.
0 references
permutation polynomial
0 references
linearized permutation
0 references
public-key encryption
0 references