Permutation polynomials and a new public-key encryption

DOI10.1016/j.dam.2015.09.001zbMath1372.94432OpenAlexW2110006913WikidataQ123029121 ScholiaQ123029121MaRDI QIDQ516791

Gurgen Khachatrian, Melsik K. Kyureghyan

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

permutation polynomialpublic-key encryptionlinearized permutation

Mathematics Subject Classification ID

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

Related Items

Compositional inverses of permutation polynomials of the form \(x^rh(x^s)\) over finite fields ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Permutation polynomials and applications to coding theory
• Linear Recurring Sequences
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems