首页> 外文会议>International Conference on Intelligent Systems and Advanced Computing Sciences >Fully homomorphic encryption scheme on a nonCommutative ring R
【24h】

Fully homomorphic encryption scheme on a nonCommutative ring R

机译:完全同性恋加密方案在非容性环R

获取原文

摘要

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.
机译:本文是对戒指中众所周知的问题的介绍 $ mathbb {f} _ {q} [e] $ 在哪里 $ pmb {e} ^ {3} = pmb {e} ^ {2} $ :完全同性恋加密方案。在本文中,我们介绍了基于共轭问题的加密图 $ mathrm {f} _ {q} [ pmb {e}],( mathbf {esr}( mathbb {f} _ {q} [pmb {e}]))$ ·该图通常无法解密,因为它依赖于在非容性参考上难以解决所谓的缀合物问题的新问题; $ mathbb {f} _ {q} [ pmb {e}] $ 。该加密方案基于两种困难的方法;离散对数问题和夫妻古典问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号