首页 | 本学科首页   官方微博 | 高级检索  
     

基于遍历矩阵的公钥加密方案
引用本文:裴士辉,赵永哲,赵宏伟.基于遍历矩阵的公钥加密方案[J].电子学报,2010,38(8):1908-1913.
作者姓名:裴士辉  赵永哲  赵宏伟
作者单位:1. 吉林大学计算机科学与技术学院,吉林长春 130012;2. 浙江工业大学软件学院,浙江杭州 310032
摘    要: 目前的公钥加密方案受到来自量子计算的威胁,研究在量子计算下安全的公开加密算法具有重要的意义.本文提出了遍历矩阵的概念,并给出了遍历矩阵的性质.同时提出了基于有限域上遍历矩阵的双侧幂乘问题(TEME:Two-side Ergodic Matrices Exponentiation),并证明了求解TEME问题是NP完全的.据此,本文提出了一个新的公钥加密方案,并在标准模型下,证明了该方案基于TEME问题的安全性,即该方案具有适应性选择密文攻击下的不可区分性.

关 键 词:公钥密码  遍历矩阵  NP完全  可证明安全性
收稿时间:2009-09-27

Public Key Encryption Scheme Based on the Ergodic Matrices
PEI Shi-hui,ZHAO Yong-zhe,ZHAO Hong-wei.Public Key Encryption Scheme Based on the Ergodic Matrices[J].Acta Electronica Sinica,2010,38(8):1908-1913.
Authors:PEI Shi-hui  ZHAO Yong-zhe  ZHAO Hong-wei
Affiliation:1. School of Computer Science and Technology,Jilin University,Changchun,Jilin 130012,China;2. School of Software,Zhejiang University of Technology,Hangzhou,Zhejiang 310032,China
Abstract:The current public key encryption schemes are vulnerable under the threat from quantum computing,it is necessary to research secure public key encryption algorithm under quantum computing.The concept of ergodic matrices and its property are given,and a new difficult problem named Two-side Ergodic Matrices Exponentiation (TEME) is proposed,which is proved at least NP-complete.Accordingly,we present a new public key encryption scheme based on ergodic matrices,and proved it is secure based on the TEME problem in the standard model,that is,the INDistinguishability against adaptively Chosen Ciphertext Attack (IND-CCA).
Keywords:public key cryptography  ergodic matrix  NP-Complete  proved security
本文献已被 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号