Open AccessOn Public-key Cryptosystem Based on the Problem of Solving a Non-Linear System of Polynomial Equations
Author(s) -
Nacer Ghadbane
Publication year - 2020
Publication title -
wseas transactions on computer research
Language(s) - English
Resource type - Journals
eISSN - 2415-1521
pISSN - 1991-8755
DOI - 10.37394/232018.2020.8.13
Subject(s) - cryptosystem , mathematics , key (lock) , invertible matrix , prime (order theory) , polynomial , finite field , field (mathematics) , affine transformation , algebra over a field , gröbner basis , cryptography , public key cryptography , discrete mathematics , encryption , pure mathematics , computer science , algorithm , combinatorics , mathematical analysis , computer security , operating system
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 Fp s be a finite field of p s elements, where p is a prime number, and s ∈ N, s ≥ 1. In this paper, we used the act of GLn (Fp s ) on the set F n p s and the transformations group, to present the public key cryptosystems based on the problem of solving a non-linear system of polynomial equations