On Public-key Cryptosystem Based on the Problem of Solving a Non-Linear System of Polynomial Equations
Keyword(s):
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
2009 ◽
Vol 10
(3)
◽
pp. 1912-1922
◽
Keyword(s):
1997 ◽
Vol 21
(3)
◽
pp. 327-346
◽
1990 ◽
Vol 2
(1)
◽
pp. 65-76
◽
2001 ◽
Vol 74
(11)
◽
pp. 1052-1061
◽
Keyword(s):
2017 ◽
Vol 11
(10)
◽
pp. 1619-1626
◽
Keyword(s):
Keyword(s):