【24h】

Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2)

机译:在GF(2)上使用遍历矩阵构造公共密钥加密方案

获取原文
获取原文并翻译 | 示例

摘要

This paper proposes a new public key encryption scheme. It is based on the difficulty of deducing x and y from A and B = x · A · y in a specific monoid (m, ·) which is noncommutative. So we select and do research work on the certain monoid which is formed by all the n×n matrices over finite field F_2 under multiplication. By the cryptographic properties of an "ergodic matrix", we propose a hard problem based on the ergodic matrices over F_2, and use it construct a public key encryption scheme.
机译:本文提出了一种新的公钥加密方案。它基于在非可交换的特定单等式(m,·)中从A和B = x·A·y推论x和y的难度。因此,我们选择有限元F_2上所有n×n个矩阵在乘法作用下形成的特定半定形进行选择并进行研究。通过“遍历矩阵”的密码性质,我们提出了一个基于F_2上遍历矩阵的难题,并使用它构造了公钥加密方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号