Publication detail
On the Detection of Permutation Polynomials
GHARIBAH, M.
English title
On the Detection of Permutation Polynomials
Type
Paper in proceedings (conference paper)
Language
en
Original abstract
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
Keywords in English
Algebra;finite fields;rings;polynomials;permutation;cryptography;quantum;physics
Released
2014-04-15
Publisher
Springer Berlin Heidelberg
Location
France
ISBN
978-3-642-55360-8
ISSN
2194-1009
Book
Algebra, Geometry and Mathematical Physics
Journal
Springer Proceedings in Mathematics & Statistics
Volume
85
Pages from–to
651–660
Pages count
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"
}