An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to latt...An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reductionalgorithms are analyzed to evaluate the security of this scheme. Furthermore, the new scheme remains the advantage of high efficiency of original NTRU.展开更多
针对格基环签名方案的陷门基尺寸过大以及环成员的公钥需要数字证书认证的问题,提出一种NTRU(Number Theory Research Unit)格上的身份基环签名方案(NTRU-IBRS)。首先,使用NTRU格上的陷门生成算法生成系统的主公私钥对;然后,将主私钥作...针对格基环签名方案的陷门基尺寸过大以及环成员的公钥需要数字证书认证的问题,提出一种NTRU(Number Theory Research Unit)格上的身份基环签名方案(NTRU-IBRS)。首先,使用NTRU格上的陷门生成算法生成系统的主公私钥对;然后,将主私钥作为陷门信息并对单向函数进行求逆运算以得到环成员的私钥;最后,基于小整数解(SIS)问题使用拒绝抽样技术生成环签名。安全性分析表明,NTRU-IBRS在随机预言机模型下具有匿名性以及适应性选择消息和身份攻击下的存在不可伪造性。性能分析与实验仿真表明,与理想格上的环签名方案和NTRU格上的身份基可链接环签名方案相比,在存储开销方面,NTRU-IBRS的系统私钥长度下降了0~99.6%,签名私钥长度的下降了50.0%~98.4%;在时间开销方面,NTRU-IBRS的总时间开销减少了15.3%~21.8%。将NTRU-IBRS应用于动态车联网(IoV)场景中,模拟结果表明NTRU-IBRS在车辆交互期间能够同时保证隐私安全和提高通信效率。展开更多
The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, ...The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, first we discuss a more general form of the ordinary cyclic code, namely φ-cyclic code, which firstly appeared in [1] and [2], thus we give a more generalized NTRUEncrypt by replacing finite field with real number field R.展开更多
随着云计算技术的发展和隐私保护的需要,同态加密域中的可逆数据隐藏已成为一项研究热点。加密域可逆数据隐藏方案大多利用了图像中像素点之间的相关性及冗余,适用范围受到了一定的限制。为了提高数据隐藏方案的适用性和嵌入容量,针对NT...随着云计算技术的发展和隐私保护的需要,同态加密域中的可逆数据隐藏已成为一项研究热点。加密域可逆数据隐藏方案大多利用了图像中像素点之间的相关性及冗余,适用范围受到了一定的限制。为了提高数据隐藏方案的适用性和嵌入容量,针对NTRU(Number Theory Research Unit)加密系统,提出了一种基于多项式划分的可逆数据隐藏方案。该方案将NTRU加密系统中的多项式空间划分为用于表示原始载体的明文段和用于隐藏数据的数据隐藏段,可用于在多种加密的数字媒体中隐藏数据。接收者可以从密文中直接提取一部分隐藏的数据,并能从解密得到的明文中提取另一部分隐藏的数据,并无损地恢复原始明文。在实验部分,分别以灰度图像和文本为例,对所提算法的可行性进行验证。实验结果表明,对于一个以8比特表示的明文值,其密文中最多可以隐藏N-8比特的数据,其中N为NTRU加密系统中的参数;当N取503时,在一个密文中最多可以隐藏495比特的数据,并能无损地恢复出原始明文值。与现有的同类方案相比,该方案所提的NTRU域可逆数据隐藏算法具有较高的嵌入容量和较强的适用性。展开更多
With the advent of quantum computing,numerous efforts have been made to standardize post-quantum cryptosystems with the intention of(eventually)replacing Elliptic Curve Cryptography(ECC)and Rivets-Shamir-Adelman(RSA)....With the advent of quantum computing,numerous efforts have been made to standardize post-quantum cryptosystems with the intention of(eventually)replacing Elliptic Curve Cryptography(ECC)and Rivets-Shamir-Adelman(RSA).A modified version of the traditional N-Th Degree Truncated Polynomial Ring(NTRU)cryptosystem called NTRU Prime has been developed to reduce the attack surface.In this paper,the Signcryption scheme was proposed,and it is most efficient than others since it reduces the complexity and runs the time of the code execution,and at the same time,provides a better security degree since it ensures the integrity of the sent message,confidentiality of the data,forward secrecy when using refreshed parameters for each session.Unforgeability to prevent the man-in-the-middle attack from being active or passive,and non-repudiation when the sender can’t deny the recently sent message.This study aims to create a novel NTRU cryptography algorithm system that takes advantage of the security features of curve fitting operations and the valuable characteristics of chaotic systems.The proposed algorithm combines the(NTRU Prime)and Shamir’s Secret Sharing(SSS)features to improve the security of the NTRU encryption and key generation stages that rely on robust polynomial generation.Based on experimental results and a comparison of the time required for crucial exchange between NTRU-SSS and the original NTRU,this study shows a rise in complexity with a decrease in execution time in the case when compared to the original NTRU.It’s encouraging to see signs that the suggested changes to the NTRU work to increase accuracy and efficiency.展开更多
本文提出一种基于公钥密码体制(Number Theory Research Unit,NTRU)选择明文攻击(Chosen Plaintext Attack,CPA)可证明安全的全同态加密方案.首先,对NTRU的密钥生成算法进行改进,通过格上的高斯抽象算法生成密钥对,避免了有效的格攻击,...本文提出一种基于公钥密码体制(Number Theory Research Unit,NTRU)选择明文攻击(Chosen Plaintext Attack,CPA)可证明安全的全同态加密方案.首先,对NTRU的密钥生成算法进行改进,通过格上的高斯抽象算法生成密钥对,避免了有效的格攻击,同时,没有改变密钥的分布.然后,基于改进的NTRU加密算法,利用Flattening技术,构造了一个全同态加密体制,并在标准模型下证明方案是选择明文攻击不可区分性IND-CPA安全的.展开更多
文摘An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reductionalgorithms are analyzed to evaluate the security of this scheme. Furthermore, the new scheme remains the advantage of high efficiency of original NTRU.
文摘针对格基环签名方案的陷门基尺寸过大以及环成员的公钥需要数字证书认证的问题,提出一种NTRU(Number Theory Research Unit)格上的身份基环签名方案(NTRU-IBRS)。首先,使用NTRU格上的陷门生成算法生成系统的主公私钥对;然后,将主私钥作为陷门信息并对单向函数进行求逆运算以得到环成员的私钥;最后,基于小整数解(SIS)问题使用拒绝抽样技术生成环签名。安全性分析表明,NTRU-IBRS在随机预言机模型下具有匿名性以及适应性选择消息和身份攻击下的存在不可伪造性。性能分析与实验仿真表明,与理想格上的环签名方案和NTRU格上的身份基可链接环签名方案相比,在存储开销方面,NTRU-IBRS的系统私钥长度下降了0~99.6%,签名私钥长度的下降了50.0%~98.4%;在时间开销方面,NTRU-IBRS的总时间开销减少了15.3%~21.8%。将NTRU-IBRS应用于动态车联网(IoV)场景中,模拟结果表明NTRU-IBRS在车辆交互期间能够同时保证隐私安全和提高通信效率。
文摘The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combined with the φ-cyclic code. To understand our construction, first we discuss a more general form of the ordinary cyclic code, namely φ-cyclic code, which firstly appeared in [1] and [2], thus we give a more generalized NTRUEncrypt by replacing finite field with real number field R.
文摘随着云计算技术的发展和隐私保护的需要,同态加密域中的可逆数据隐藏已成为一项研究热点。加密域可逆数据隐藏方案大多利用了图像中像素点之间的相关性及冗余,适用范围受到了一定的限制。为了提高数据隐藏方案的适用性和嵌入容量,针对NTRU(Number Theory Research Unit)加密系统,提出了一种基于多项式划分的可逆数据隐藏方案。该方案将NTRU加密系统中的多项式空间划分为用于表示原始载体的明文段和用于隐藏数据的数据隐藏段,可用于在多种加密的数字媒体中隐藏数据。接收者可以从密文中直接提取一部分隐藏的数据,并能从解密得到的明文中提取另一部分隐藏的数据,并无损地恢复原始明文。在实验部分,分别以灰度图像和文本为例,对所提算法的可行性进行验证。实验结果表明,对于一个以8比特表示的明文值,其密文中最多可以隐藏N-8比特的数据,其中N为NTRU加密系统中的参数;当N取503时,在一个密文中最多可以隐藏495比特的数据,并能无损地恢复出原始明文值。与现有的同类方案相比,该方案所提的NTRU域可逆数据隐藏算法具有较高的嵌入容量和较强的适用性。
文摘With the advent of quantum computing,numerous efforts have been made to standardize post-quantum cryptosystems with the intention of(eventually)replacing Elliptic Curve Cryptography(ECC)and Rivets-Shamir-Adelman(RSA).A modified version of the traditional N-Th Degree Truncated Polynomial Ring(NTRU)cryptosystem called NTRU Prime has been developed to reduce the attack surface.In this paper,the Signcryption scheme was proposed,and it is most efficient than others since it reduces the complexity and runs the time of the code execution,and at the same time,provides a better security degree since it ensures the integrity of the sent message,confidentiality of the data,forward secrecy when using refreshed parameters for each session.Unforgeability to prevent the man-in-the-middle attack from being active or passive,and non-repudiation when the sender can’t deny the recently sent message.This study aims to create a novel NTRU cryptography algorithm system that takes advantage of the security features of curve fitting operations and the valuable characteristics of chaotic systems.The proposed algorithm combines the(NTRU Prime)and Shamir’s Secret Sharing(SSS)features to improve the security of the NTRU encryption and key generation stages that rely on robust polynomial generation.Based on experimental results and a comparison of the time required for crucial exchange between NTRU-SSS and the original NTRU,this study shows a rise in complexity with a decrease in execution time in the case when compared to the original NTRU.It’s encouraging to see signs that the suggested changes to the NTRU work to increase accuracy and efficiency.
文摘本文提出一种基于公钥密码体制(Number Theory Research Unit,NTRU)选择明文攻击(Chosen Plaintext Attack,CPA)可证明安全的全同态加密方案.首先,对NTRU的密钥生成算法进行改进,通过格上的高斯抽象算法生成密钥对,避免了有效的格攻击,同时,没有改变密钥的分布.然后,基于改进的NTRU加密算法,利用Flattening技术,构造了一个全同态加密体制,并在标准模型下证明方案是选择明文攻击不可区分性IND-CPA安全的.
