WSEAS Transactions on Computer Research
Print ISSN: 1991-8755, E-ISSN: 2415-1521
Volume 8, 2020
On Public-key Cryptosystem Based on the Problem of Solving a Non-Linear System of Polynomial Equations
Author:
Abstract: The basic idea behind multivariate cryptography is to choose a system of polynomials which can be easily inverted (central map). After that one chooses two affine invertible maps to hide the structure of the central map. Fellows and Koblitz outlined a conceptual key cryptosystem based on the hardness of POSSO. Let Fps be a finite field of ps elements, where p is a prime number, and s ∈ N, s ≥ 1. In this paper, we used the act of GLn (Fps) on the set Fn ps and the transformations group, to present the public key cryptosystems based on the problem of solving a non-linear system of polynomial equations.
Search Articles
Keywords: Group,Finite field, Group action on a set, General linear group, Linear transformation, Public key cryptography
Pages: 106-110
DOI: 10.37394/232018.2020.8.13