首页> 外文会议>ICCEE 2010;International conference on computer and electrical engineering >P Systems Solving the Discrete Logarithm Problem in Polynomial Time
【24h】

P Systems Solving the Discrete Logarithm Problem in Polynomial Time

机译:P系统解决多项式离散对数问题

获取原文
获取外文期刊封面目录资料

摘要

P systems are a cluster of distributed parallel computing devices in a biochemical type. The discrete logarithm problem has been used as the basis of several cryptosysterns. This paper presents a P system with active membranes to solve the discrete logarithm problem used in Diffie-Hellman key exchange protocol. To the best of our knowledge, it's the first time to solve the problem using P systems in polynomial time.
机译:P系统是生化类型的分布式并行计算设备的集群。离散对数问题已用作几种密码系统的基础。本文提出了一种具有主动膜的P系统,以解决Diffie-Hellman密钥交换协议中使用的离散对数问题。据我们所知,这是第一次在多项式时间内使用P系统解决问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号