In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary...In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation.展开更多
j-lanes tree hashing is a tree mode that splits an input message into?j?slices, computes?j?independent digests of each slice, and outputs the hash value of their concatenation.?j-pointers tree hashing is a similar tre...j-lanes tree hashing is a tree mode that splits an input message into?j?slices, computes?j?independent digests of each slice, and outputs the hash value of their concatenation.?j-pointers tree hashing is a similar tree mode that receives, as input,?j?pointers to?j?messages (or slices of a single message), computes their digests and outputs the hash value of their concatenation. Such modes expose parallelization opportunities in a hashing process that is otherwise serial by nature. As a result, they have a performance advantage on modern processor architectures. This paper provides precise specifications for these hashing modes, proposes appropriate IVs, and demonstrates their performance on the latest processors. Our hope is that it would be useful for standardization of these modes.展开更多
j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-l...j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-lanes hashing on SIMD architectures, by coding a 4-lanes-SHA-256 implementation and measuring its performance on the latest 3rd Generation IntelR CoreTM. For messages whose lengths range from 2 KB to 132 KB, we show that the 4-lanes SHA-256 is between 1.5 to 1.97 times faster than the fastest publicly available implementation that we are aware of, and between ~2 to ~2.5 times faster than the OpenSSL 1.0.1c implementation. For long messages, there is no significant performance difference between different choices of j. We show that the 4-lanes SHA-256 is faster than the two SHA3 finalists (BLAKE and Keccak) that have a published tree mode implementation. Finally, we explain why j-lanes hashing will be faster on the coming AVX2 architecture that facilitates using 256 bits registers. These results suggest that standardizing a tree mode for hash functions (SHA-256 in particular) could be useful for performance hungry applications.展开更多
一般的量子图像加密算法虽然能达到加密效果,但需要的量子比特数较多,计算复杂度较高,为优化这一问题,提出了一种位平面分解的量子彩色图像加密方案。首先,采用一种位平面序信息单独编码的彩色数字图像量子表示模型(quantum representat...一般的量子图像加密算法虽然能达到加密效果,但需要的量子比特数较多,计算复杂度较高,为优化这一问题,提出了一种位平面分解的量子彩色图像加密方案。首先,采用一种位平面序信息单独编码的彩色数字图像量子表示模型(quantum representation model of color digital image,QRCI)来表示图像,利用量子交换门设计一种量子位交换操作,并作用于彩色图像中,对图像像素进行置乱,同时再对图像进行颜色通道交换操作。其次,对位平面序列进行反序操作,进一步加强置乱效果。接着,利用安全散列算法(secure hash algorithm 256,SHA-256)产生的哈希值来确定混沌系统的初始值。最后,利用混沌系统产生的序列对图像进行扩散,完成加密过程,形成加密图像。数值分析表明,相较于以往的加密方案,此方案大大降低了彩色图像存储时所需的量子比特位数,同时其密钥空间大,灵敏度高。仿真结果表明,该方案加密效果好,能抵御大部分常见的攻击。展开更多
基金Supported by the National High Technology Research and Development Program(No.2011AA010803)the National Natural Science Foundation of China(No.U1204602)
文摘In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation.
文摘j-lanes tree hashing is a tree mode that splits an input message into?j?slices, computes?j?independent digests of each slice, and outputs the hash value of their concatenation.?j-pointers tree hashing is a similar tree mode that receives, as input,?j?pointers to?j?messages (or slices of a single message), computes their digests and outputs the hash value of their concatenation. Such modes expose parallelization opportunities in a hashing process that is otherwise serial by nature. As a result, they have a performance advantage on modern processor architectures. This paper provides precise specifications for these hashing modes, proposes appropriate IVs, and demonstrates their performance on the latest processors. Our hope is that it would be useful for standardization of these modes.
文摘j-lanes hashing is a tree mode that splits an input message to j slices, computes j independent digests of each slice, and outputs the hash value of their concatenation. We demonstrate the performance advantage of j-lanes hashing on SIMD architectures, by coding a 4-lanes-SHA-256 implementation and measuring its performance on the latest 3rd Generation IntelR CoreTM. For messages whose lengths range from 2 KB to 132 KB, we show that the 4-lanes SHA-256 is between 1.5 to 1.97 times faster than the fastest publicly available implementation that we are aware of, and between ~2 to ~2.5 times faster than the OpenSSL 1.0.1c implementation. For long messages, there is no significant performance difference between different choices of j. We show that the 4-lanes SHA-256 is faster than the two SHA3 finalists (BLAKE and Keccak) that have a published tree mode implementation. Finally, we explain why j-lanes hashing will be faster on the coming AVX2 architecture that facilitates using 256 bits registers. These results suggest that standardizing a tree mode for hash functions (SHA-256 in particular) could be useful for performance hungry applications.
文摘一般的量子图像加密算法虽然能达到加密效果,但需要的量子比特数较多,计算复杂度较高,为优化这一问题,提出了一种位平面分解的量子彩色图像加密方案。首先,采用一种位平面序信息单独编码的彩色数字图像量子表示模型(quantum representation model of color digital image,QRCI)来表示图像,利用量子交换门设计一种量子位交换操作,并作用于彩色图像中,对图像像素进行置乱,同时再对图像进行颜色通道交换操作。其次,对位平面序列进行反序操作,进一步加强置乱效果。接着,利用安全散列算法(secure hash algorithm 256,SHA-256)产生的哈希值来确定混沌系统的初始值。最后,利用混沌系统产生的序列对图像进行扩散,完成加密过程,形成加密图像。数值分析表明,相较于以往的加密方案,此方案大大降低了彩色图像存储时所需的量子比特位数,同时其密钥空间大,灵敏度高。仿真结果表明,该方案加密效果好,能抵御大部分常见的攻击。
