With the rapid development of information technology, demand of network & information security has increased. People enjoy many benefits by virtue of information technology. At the same time network security has b...With the rapid development of information technology, demand of network & information security has increased. People enjoy many benefits by virtue of information technology. At the same time network security has become the important challenge, but network information security has become a top priority. In the field of authentication, dynamic password technology has gained users’ trust and favor because of its safety and ease of operation. Dynamic password, SHA (Secure Hash Algorithm) is widely used globally and acts as information security mechanism against potential threat. The cryptographic algorithm is an open research area, and development of these state-owned technology products helps secure encryption product and provides safeguard against threats. Dynamic password authentication technology is based on time synchronization, using the state-owned password algorithm. SM3 hash algorithm can meet the security needs of a variety of cryptographic applications for commercial cryptographic applications and verification of digital signatures, generation and verification of message authentication code. Dynamic password basically generates an unpredictable random numbers based on a combination of specialized algorithms. Each password can only be used once, and help provide high safety. Therefore, the dynamic password technology for network information security issues is of great significance. In our proposed algorithm, dynamic password is generated by SM3 Hash Algorithm using current time and the identity ID and it varies with time and changes randomly. Coupled with the SM3 hash algorithm security, dynamic password security properties can be further improved, thus it effectively improves network authentication security.展开更多
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.展开更多
In today’s world of massive data and interconnected networks,it’s crucial to burgeon a secure and efficient digital watermarking method to protect the copyrights of digital content.Existing research primarily focuse...In today’s world of massive data and interconnected networks,it’s crucial to burgeon a secure and efficient digital watermarking method to protect the copyrights of digital content.Existing research primarily focuses on deep learning-based approaches to improve the quality of watermarked images,but they have some flaws.To overcome this,the deep learning digital image watermarking model with highly secure algorithms is proposed to secure the digital image.Recently,quantum logistic maps,which combine the concept of quantum computing with traditional techniques,have been considered a niche and promising area of research that has attracted researchers’attention to further research in digital watermarking.This research uses the chaotic behaviour of the quantum logistic map with Rivest–Shamir–Adleman(RSA)and Secure Hash(SHA-3)algorithms for a robust watermark embedding process,where a watermark is embedded into the host image.This way,the quantum chaos method not only helps limit the chance of tampering with the image content through reverse engineering but also assists in maintaining a high level of imperceptibility and strong robustness with efficient extraction or detection of watermark images.Lifting Wavelet Transformation(LWT)is a potential and computationally efficient version of traditional Discrete Wavelet Transform(DWT)where the host image is divided into four sub-bands to offer a multi-resolution view of an image with greater flexibility in watermarking methodologies.Furthermore,considering the robustness against attacks,a pre-trained Residual Neural Network(ResNet-50),a convolutional neural network with 50 layers deep,is used to better learn the complex features and efficiently extract the watermark from the image.By integrating RSA and SHA-3 algorithms,the proposed model demonstrates improved imperceptibility,robustness,and accuracy in watermark extraction compared to traditional methods.It achieves a Peak Signal-to-Noise Ratio(PSNR)of 49.83%,a Structural Similarity Index Measure(SSIM)of 0.98,and a Number of Pixels Change Rate(NPCR)of 99.79%,respectively.These results reflect the model’s effectiveness in delivering superior quality and security.Consequently,our proposed approach offers accurate results,exceptional invisibility,and enhanced robustness compared to the existing digital image watermarking techniques.展开更多
In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the...In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the design and the attacks on these hash functions. However, it is very significant to study some properties of their primitives and underlying permutations. Because some properties reflect the pseudo-randomness of the structures. Moreover, they help us to find new cryptanalysis for some block cipher structures. In this paper, we analyze the resistance of JH and Grcstl-512 against structural properties built on integral distinguishers. And then 31.5 （out of 42） rounds integral distinguishers for JH compression function and 11.5 （out of 14） rounds for Grcstl-512 compression function are presented.展开更多
文摘With the rapid development of information technology, demand of network & information security has increased. People enjoy many benefits by virtue of information technology. At the same time network security has become the important challenge, but network information security has become a top priority. In the field of authentication, dynamic password technology has gained users’ trust and favor because of its safety and ease of operation. Dynamic password, SHA (Secure Hash Algorithm) is widely used globally and acts as information security mechanism against potential threat. The cryptographic algorithm is an open research area, and development of these state-owned technology products helps secure encryption product and provides safeguard against threats. Dynamic password authentication technology is based on time synchronization, using the state-owned password algorithm. SM3 hash algorithm can meet the security needs of a variety of cryptographic applications for commercial cryptographic applications and verification of digital signatures, generation and verification of message authentication code. Dynamic password basically generates an unpredictable random numbers based on a combination of specialized algorithms. Each password can only be used once, and help provide high safety. Therefore, the dynamic password technology for network information security issues is of great significance. In our proposed algorithm, dynamic password is generated by SM3 Hash Algorithm using current time and the identity ID and it varies with time and changes randomly. Coupled with the SM3 hash algorithm security, dynamic password security properties can be further improved, thus it effectively improves network authentication security.
文摘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.
文摘In today’s world of massive data and interconnected networks,it’s crucial to burgeon a secure and efficient digital watermarking method to protect the copyrights of digital content.Existing research primarily focuses on deep learning-based approaches to improve the quality of watermarked images,but they have some flaws.To overcome this,the deep learning digital image watermarking model with highly secure algorithms is proposed to secure the digital image.Recently,quantum logistic maps,which combine the concept of quantum computing with traditional techniques,have been considered a niche and promising area of research that has attracted researchers’attention to further research in digital watermarking.This research uses the chaotic behaviour of the quantum logistic map with Rivest–Shamir–Adleman(RSA)and Secure Hash(SHA-3)algorithms for a robust watermark embedding process,where a watermark is embedded into the host image.This way,the quantum chaos method not only helps limit the chance of tampering with the image content through reverse engineering but also assists in maintaining a high level of imperceptibility and strong robustness with efficient extraction or detection of watermark images.Lifting Wavelet Transformation(LWT)is a potential and computationally efficient version of traditional Discrete Wavelet Transform(DWT)where the host image is divided into four sub-bands to offer a multi-resolution view of an image with greater flexibility in watermarking methodologies.Furthermore,considering the robustness against attacks,a pre-trained Residual Neural Network(ResNet-50),a convolutional neural network with 50 layers deep,is used to better learn the complex features and efficiently extract the watermark from the image.By integrating RSA and SHA-3 algorithms,the proposed model demonstrates improved imperceptibility,robustness,and accuracy in watermark extraction compared to traditional methods.It achieves a Peak Signal-to-Noise Ratio(PSNR)of 49.83%,a Structural Similarity Index Measure(SSIM)of 0.98,and a Number of Pixels Change Rate(NPCR)of 99.79%,respectively.These results reflect the model’s effectiveness in delivering superior quality and security.Consequently,our proposed approach offers accurate results,exceptional invisibility,and enhanced robustness compared to the existing digital image watermarking techniques.
基金Supported by the National Natural Science Foundation of China (No. 60873259 and No. 60903212)Knowledge Innovation Project of the Chinese Academy of Sciences
文摘In December of 2010 NIST selected five SHA-3 finalists - BLAKE, Grcstl, JH, Keccak, and Skein to advance to the third （and final） round of the SHA-3 competition. At present most specialists and scholars focus on the design and the attacks on these hash functions. However, it is very significant to study some properties of their primitives and underlying permutations. Because some properties reflect the pseudo-randomness of the structures. Moreover, they help us to find new cryptanalysis for some block cipher structures. In this paper, we analyze the resistance of JH and Grcstl-512 against structural properties built on integral distinguishers. And then 31.5 （out of 42） rounds integral distinguishers for JH compression function and 11.5 （out of 14） rounds for Grcstl-512 compression function are presented.
