Permutation polynomials and a new public-key encryption (Q516791): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q123029121, #quickstatements; #temporary_batch_1714632961156 |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Melsik K. Kyureghyan / rank | |||
Property / author | |||
Property / author: Melsik K. Kyureghyan / rank | |||
Normal rank | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Wilfried Meidl / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94A60 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11T71 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11T06 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6695012 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutation polynomial | |||
Property / zbMATH Keywords: permutation polynomial / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linearized permutation | |||
Property / zbMATH Keywords: linearized permutation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
public-key encryption | |||
Property / zbMATH Keywords: public-key encryption / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.09.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2110006913 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123029121 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:56, 2 May 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