Biblio
Filters: Keyword is conjugate problem [Clear All Filters]
.
2019. Elliptic curve and Lattice cryptosystem. 2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS). :1—4.
In this work, we will present a new hybrid cryptography method based on two hard problems: 1- The problem of the discrete logarithm on an elliptic curve defined on a finite local ring. 2- The closest vector problem in lattice and the conjugate problem on square matrices. At first, we will make the exchange of keys to the Diffie-Hellman. The encryption of a message is done with a bad basis of a lattice.
.
2019. Fully homomorphic encryption scheme on a nonCommutative ring R. 2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS). :1–4.
This article is an introduction to a well known problem on the ring Fq[e] where e3=e2: Fully homomorphic encryption scheme. In this paper, we introduce a new diagram of encryption based on the conjugate problem on Fq[e] , (ESR(Fq[e])).