Permutation polynomials and a new public-key encryption

DOI10.1016/J.DAM.2015.09.001MaRDI QIDQ516791zbMATH OpenOpenAlexWikidataFDO

Authors Gurgen Khachatrian, Melsik K. Kuyregyan

Publication date 15 March 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.09.001

zbMATH Keywords

linearized permutationpermutation polynomialpublic-key encryption

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

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.

Recommendations

• Cryptosystems based on permutation polynomials
• A public key cryptosystem using a group of permutation polynomials
• Cryptological Applications of Permutation Polynomials
• Permutation polynomials in RSA-cryptosystems
• Permutation polynomials of \(\mathbb F_{p^m}\)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• Linear Recurring Sequences
• New directions in cryptography
• Permutation polynomials and applications to coding theory

Cited in

(13)

• Quadratic time algorithm for inversion of binary permutation polynomials
• Compositional inverses of permutation polynomials of the form x^rh(x^s) over finite fields
• A public key cryptosystem using a group of permutation polynomials
• Cryptological Applications of Permutation Polynomials
• On some properties of graph based public keys
• A simple variant of the Merkle-Damgård scheme with a permutation
• Cryptosystems based on permutation polynomials
• Permutation polynomials in RSA-cryptosystems
• Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption
• A method for generating permutation polynomials modulo p^n
• A Simple Variant of the Merkle-Damgård Scheme with a Permutation
• scientific article; zbMATH DE number 5252113 (Why is no real title available?)
• Permutation After RC4 Key Scheduling Reveals the Secret Key

This page was built for publication: Permutation polynomials and a new public-key encryption

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