On Public-key Cryptosystem Based on the Problem of Solving a Non-Linear System of Polynomial Equations
WSEAS TRANSACTIONS ON COMPUTER RESEARCH · 2020
DOI: 10.37394/232018.2020.8.13 ↗Kurz gefasst
Fachartikel in der Zeitschrift WSEAS TRANSACTIONS ON COMPUTER RESEARCH, 2020. Verfasst von Nacer Ghadbane. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 17 Literaturangaben.
Abstract (Originalsprache)
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
Zitieren
APA
Ghadbane, N. (2020). On Public-key Cryptosystem Based on the Problem of Solving a Non-Linear System of Polynomial Equations. WSEAS TRANSACTIONS ON COMPUTER RESEARCH. https://doi.org/10.37394/232018.2020.8.13
Vancouver
Ghadbane N. On Public-key Cryptosystem Based on the Problem of Solving a Non-Linear System of Polynomial Equations. WSEAS TRANSACTIONS ON COMPUTER RESEARCH. 2020. doi:10.37394/232018.2020.8.13
BibTeX
@article{Ghadbane2020,
author = {Ghadbane, Nacer},
title = {On Public-key Cryptosystem Based on the Problem of Solving a Non-Linear System of Polynomial Equations},
journal = {WSEAS TRANSACTIONS ON COMPUTER RESEARCH},
year = {2020},
doi = {10.37394/232018.2020.8.13}
}
EUVIMED