The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing....The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.展开更多
2003年Akavia基于列表译码提出研究硬核谓词的一般框架,并将该方法成功地应用于许多硬核谓词的研究.但是,对于ax+b mod p的任意比特是任意单向函数的硬核谓词,这个关于单向函数的一般性结论能否适用,仍是一个公开问题.文章利用这种新方...2003年Akavia基于列表译码提出研究硬核谓词的一般框架,并将该方法成功地应用于许多硬核谓词的研究.但是,对于ax+b mod p的任意比特是任意单向函数的硬核谓词,这个关于单向函数的一般性结论能否适用,仍是一个公开问题.文章利用这种新方法研究积性码可接近的单向陷门函数的比特安全性,并且证明ax+b mod p的任意比特是p阶循环群上该类单向函数的硬核谓词.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386)the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004)+2 种基金the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008)Major State Basic Research Development Program of China(973 Program)(No.2014CB340600)the Hubei Natural Science Foundation of China(Grant No.2011CDB453,2014CFB440)
文摘The hardness of tensor decomposition problem has many achievements, but limited applications in cryptography, and the tensor decomposition problem has been considered to have the potential to resist quantum computing. In this paper, we firstly proposed a new variant of tensor decomposition problem, then two one-way functions are proposed based on the hard problem. Secondly we propose a key exchange protocol based on the one-way functions, then the security analysis, efficiency, recommended parameters and etc. are also given. The analyses show that our scheme has the following characteristics: easy to implement in software and hardware, security can be reduced to hard problems, and it has the potential to resist quantum computing.Besides the new key exchange can be as an alternative comparing with other classical key protocols.
文摘2003年Akavia基于列表译码提出研究硬核谓词的一般框架,并将该方法成功地应用于许多硬核谓词的研究.但是,对于ax+b mod p的任意比特是任意单向函数的硬核谓词,这个关于单向函数的一般性结论能否适用,仍是一个公开问题.文章利用这种新方法研究积性码可接近的单向陷门函数的比特安全性,并且证明ax+b mod p的任意比特是p阶循环群上该类单向函数的硬核谓词.
