Detail publikace
On the Detection of Permutation Polynomials
GHARIBAH, M.
Anglický název
On the Detection of Permutation Polynomials
Typ
Stať ve sborníku v databázi WoS či Scopus
Jazyk
en
Originální abstrakt
Multivariate Public keyPublic key cryptosystems are widely spread and ever evolving domain. This study aims to find new techniques to characterize and detect permutation polynomialsPermutation polynomial over finite fieldsFinite field, which enable us to find trapdoor, one way, functions that are essential to build robust cryptosystems. Let f be a polynomial over Fq, a finite fieldFinite field of order q, where q=pm, p is a prime number. If f induces a bijective mapping, one-to-one mapping, of Fq, we call f a permutation polynomialPermutation polynomial over Fq. In order to detect these polynomials, we constructed a program implementing multiple algorithmsAlgorithm based on Galois fieldGalois field arithmetic. As a result, we have the number of all possible permutation polynomialsPermutation polynomial in the fields F4, F8 and F16
Klíčová slova anglicky
Algebra;finite fields;rings;polynomials;permutation;cryptography;quantum;physics
Vydáno
2014-04-15
Nakladatel
Springer Berlin Heidelberg
Místo
France
ISBN
978-3-642-55360-8
ISSN
2194-1009
Kniha
Algebra, Geometry and Mathematical Physics
Časopis
Springer Proceedings in Mathematics & Statistics
Ročník
85
Strany od–do
651–660
Počet stran
9
BIBTEX
@inproceedings{BUT109063,
author="Mazen {Gharibah}",
title="On the Detection of Permutation Polynomials",
booktitle="Algebra, Geometry and Mathematical Physics",
year="2014",
series="Springer Proceedings in Mathematics & Statistics",
journal="Springer Proceedings in Mathematics & Statistics",
volume="85",
number="85",
pages="651--660",
publisher="Springer Berlin Heidelberg",
address="France",
doi="10.1007/978-3-642-55361-5\{_}39",
isbn="978-3-642-55360-8",
issn="2194-1009"
}