{"title":"Fully homomorphic encryption scheme on a nonCommutative ring R","authors":"M. Elhassani, A. Boulbot, A. Chillali, A. Mouhib","doi":"10.1109/ISACS48493.2019.9068892","DOIUrl":null,"url":null,"abstract":"This article is an introduction to a well known problem on the ring $\\mathbb{F}_{q}[e]$ where $\\pmb{e}^{3}=\\pmb{e}^{2}$: Fully homomorphic encryption scheme. In this paper, we introduce a new diagram of encryption based on the conjugate problem on $\\mathrm{F}_{q}[\\pmb{e}],(\\mathbf{ESR}(\\mathbb{F}_{q}[\\pmb{e}]))$ · This diagram is generally impossible to decipher because it rests on a new problem very difficult to solve called problem of conjugate on a noncommutative reference; $\\mathbb{F}_{q}[\\pmb{e}]$. This encryption scheme is based on two difficult methodes; discrete logarithm problem and conjugal classical problem.","PeriodicalId":312521,"journal":{"name":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","volume":"539 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISACS48493.2019.9068892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This article is an introduction to a well known problem on the ring $\mathbb{F}_{q}[e]$ where $\pmb{e}^{3}=\pmb{e}^{2}$: Fully homomorphic encryption scheme. In this paper, we introduce a new diagram of encryption based on the conjugate problem on $\mathrm{F}_{q}[\pmb{e}],(\mathbf{ESR}(\mathbb{F}_{q}[\pmb{e}]))$ · This diagram is generally impossible to decipher because it rests on a new problem very difficult to solve called problem of conjugate on a noncommutative reference; $\mathbb{F}_{q}[\pmb{e}]$. This encryption scheme is based on two difficult methodes; discrete logarithm problem and conjugal classical problem.