Recently,several PC oracle based side-channel attacks have been proposed against Kyber.However,most of them focus on unprotected implementations and masking is considered as a counter-measure.In this study,we extend P...Recently,several PC oracle based side-channel attacks have been proposed against Kyber.However,most of them focus on unprotected implementations and masking is considered as a counter-measure.In this study,we extend PC oracle based side-channel attacks to the second-order scenario and successfully conduct key-recovery attacks on the first-order masked Kyber.Firstly,we analyze the potential joint information leakage.Inspired by the binary PC oracle based attack proposed by Qin et al.at Asiacrypt 2021,we identify the 1-bit leakage scenario in the masked Keccak implementation.Moreover,we modify the ciphertexts construction described by Tanaka et al.at CHES 2023,extending the leakage scenario from 1-bit to 32-bit.With the assistance of TVLA,we validate these leakages through experiments.Secondly,for these two scenarios,we construct a binary PC oracle based on t-test and a multiple-valued PC oracle based on neural networks.Furthermore,we conduct practical side-channel attacks on masked Kyber by utilizing our oracles,with the implementation running on an ARM Cortex-M4 microcontroller.The demonstrated attacks require a minimum of 15788 and 648 traces to fully recover the key of Kyber768 in the 1-bit leakage scenario and the 32-bit leakage scenario,respectively.Our analysis may also be extended to attack other post-quantum schemes that use the same masked hash function.Finally,we apply the shuffling strategy to the first-order masked imple-mentation of the Kyber and perform leakage tests.Experimental results show that the combination strategy of shuffling and masking can effectively resist our proposed attacks.展开更多
In order to meet the needs of higher operation speed and lower energy consumption an optimized SHA-1 algorithm is proposed.It combines two methods loop-unfolding and pre-processing.In the process intermediate variable...In order to meet the needs of higher operation speed and lower energy consumption an optimized SHA-1 algorithm is proposed.It combines two methods loop-unfolding and pre-processing.In the process intermediate variables are introduced in the iterations and pre-calculated so that the original single-threading operation can perform in a multi-threading way.This optimized algorithm exploits parallelism to shorten the critical path for hash operations.And the cycles of the original algorithm are reduced from 80 to 41 which greatly improves the operation speed.Therefore the shortened iterations of the optimized design require a smaller amount of hardware resource thus achieving a lower energy consumption. The optimized algorithm is implemented on FPGA field programmable gate array .It can achieve a throughput rate of 1.2 Gbit /s with the maximum clock frequency of 91 MHz reaching a fair balance between operation speed and throughput rate.The simulation results show that compared with other optimized SHA-1 algorithms this algorithm obtains higher operation speed and throughput rate without compromising the security of the original SHA-1 algorithm.展开更多
The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefo...The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions.展开更多
The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos ...The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos characteristics is proposed. First, the chaos sequence is gotten by iterating cellular neural network with Runge Kutta algorithm, and then the chaos sequence is iterated with the message. The hash code is obtained through the corre- sponding transform of the latter chaos sequence. Simulation and analysis demonstrate that the new method has the merit of convenience, high sensitivity to initial values, good hash performance, especially the strong stability.展开更多
Multivariate hash functions are a type of hash functions whose compression function is explicitly defined as a sequence of multivariate equations. Billet et al designed the hash function MQ-HASH and Ding et al propose...Multivariate hash functions are a type of hash functions whose compression function is explicitly defined as a sequence of multivariate equations. Billet et al designed the hash function MQ-HASH and Ding et al proposed a similar construction. In this paper, we analyze the security of multivariate hash functions and conclude that low degree multivariate functions such as MQ-HASH are neither pseudo-random nor unpredictable. There may be trivial collisions and fixed point attacks if the parameters of the compression function have been chosen. And they are also not computation-resistance, which makes MAC forgery easily.展开更多
A novel scheme to construct a hash function based on a weighted complex dynamical network （WCDN） generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then...A novel scheme to construct a hash function based on a weighted complex dynamical network （WCDN） generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency.展开更多
A new one-way hash function based on the unified chaotic system is constructed. With different values of a key parameter, the unified chaotic system represents different chaotic systems, based on which the one-way has...A new one-way hash function based on the unified chaotic system is constructed. With different values of a key parameter, the unified chaotic system represents different chaotic systems, based on which the one-way hash function algorithm is constructed with three round operations and an initial vector on an input message. In each round operation, the parameters are processed by three different chaotic systems generated from the unified chaotic system. Feed-forwards are used at the end of each round operation and at the end of each element of the message processing. Meanwhile, in each round operation, parameter-exchanging operations are implemented. Then, the hash value of length 160 bits is obtained from the last six parameters. Simulation and analysis both demonstrate that the algorithm has great flexibility, satisfactory hash performance, weak collision property, and high security.展开更多
A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map...A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map, and use it to construct Hash function. First we divide the message into groups, and then carry out the Xor operation between the ASCII value of each group and the binary sequence, the result can be used as the initial values of the next loop. Repeat the procedure until all the groups have been processed, and the final binary sequence is the Hash value. In the scheme, the initial values of the generalized Henon map are used as the secret key and the messages are mapped to Hash values with a designated length. Simulation results show that the proposed scheme has strong diffusion and confusion capability, good collision resistance, large key space, extreme sensitivity to message and secret key, and it is easy to be realized and extended.展开更多
To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication sch...To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication schemes are being faced with big challenges.We take the message authentication as an example into a careful consideration.Then,we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication function.Firstly,the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values,which ensures that the initial message can resist eavesdropping attack.Secondly,utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties,such as one-wayness,resisting different collisions and easy implementation.Based on these two points,the message authentication scheme can be much more secure than previous ones.Finally,it is a new way to design the message authentication scheme,which provides a new thought for other researchers in the future.Our works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future.展开更多
For the 64 most basic ways to construct a hash function H:{0,1} → {0,1}n from a block cipher E:{0,1}n × {0,1}n → {0,1}n, Black et al.provided a formal and quantitative treatment of the 64 constructions, and pro...For the 64 most basic ways to construct a hash function H:{0,1} → {0,1}n from a block cipher E:{0,1}n × {0,1}n → {0,1}n, Black et al.provided a formal and quantitative treatment of the 64 constructions, and proved that 20 schemes are collision resistant.This paper improves the upper and lower bounds and make contrast with a hash constructed from a random oracle.These 20 schemes have only one kind of collision resistance upper and lower bounds.In addition, we present new advantages for finding second preimages.展开更多
This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Thr...This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Through theoretical analysis and experimental imitation,our new algorithm is proven to be more secure and efficient than G-SHA1.Simultaneously,we introduce and discuss the BLAKE in detail.Its security shows that can be utilized to generate pseudorandom bit sequences,which the experimental results show the BLAKE hash function has excellent pseudorandomness.Therefore,we believe the BLAKE is one of the most potential candidate algorithms of SHA-3 program.展开更多
A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position i...A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position index of blocked messages is chosen, and blocked massages translated into ASCII code values are employed as the iteration time of the chaotic tent map. The final 128-bit hash value is generated by logical XOR operation on intermediate hash values. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function.展开更多
Message integrity is found to prove the transfer information of patient in health care monitoring system on the human body in order to collect and communicate the human personal data. Wireless body area network (WBAN)...Message integrity is found to prove the transfer information of patient in health care monitoring system on the human body in order to collect and communicate the human personal data. Wireless body area network (WBAN) applications are the fast growing technology trend but security and privacy are still largely ignored, since they are hard to achieve given the limited computation and energy resources available at sensor node level. In this paper, we propose simple hash based message authentication and integrity code algorithm for wireless sensor networks. We test the proposed algorithm in MATLAB on path loss model around the human body in two scenarios and compare the result before and after enhancement and show how sensors are connected with each other to prove the message integrity in monitoring health environment.展开更多
When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a ma...When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance.展开更多
Based on the spatiotemporal chaotic system, a novel algorithm for constructing a one-way hash function is proposed and analysed. The message is divided into fixed length blocks. Each message block is processed by the ...Based on the spatiotemporal chaotic system, a novel algorithm for constructing a one-way hash function is proposed and analysed. The message is divided into fixed length blocks. Each message block is processed by the hash compression function in parallel. The hash compression is constructed based on the spatiotemporal chaos. In each message block, the ASCII code and its position in the whole message block chain constitute the initial conditions and the key of the hash compression function. The final hash value is generated by further compressing the mixed result of all the hash compression vulues. Theoretic analyses and numerical simulations show that the proposed algorithm presents high sensitivity to the message and key, good statistical properties, and strong collision resistance.展开更多
Hash functions are often used in the authentication of information security field. With the development of electronic commerce, the reliability of authentication is paid more and more attention to. This paper describe...Hash functions are often used in the authentication of information security field. With the development of electronic commerce, the reliability of authentication is paid more and more attention to. This paper describes an N - LFSR which combined nonlinear S - box with the LF-SR, and substitutes it for CLS operator in hash function. The efficiency of new hash function is not drop and the ability of defence attack is strengthened.展开更多
In this paper,based on coupled network generated by chaotic logarithmic map,a novel algorithm for constructing hash functions is proposed,which can transform messages and can establish a mapping from the transformed m...In this paper,based on coupled network generated by chaotic logarithmic map,a novel algorithm for constructing hash functions is proposed,which can transform messages and can establish a mapping from the transformed messages to the coupled matrix of the network.The network model is carefully designed to ensure the network dynamics to be chaotic.Through the chaotic iterations of the network,quantization and exclusive-or (XOR) operations,the algorithm can construct hash value with arbitrary length.It is shown by simulations that the algorithm is extremely sensitive to the initial values and the coupled matrix of the network,and has excellent performance in one-way,confusion and diffusion,and collision resistance.展开更多
Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption.The earliest attempt to achieve homomorphic evaluation of SHA-256 h...Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption.The earliest attempt to achieve homomorphic evaluation of SHA-256 hash function was proposed by Mella and Susella(in:Cryptography and coding—14th IMA international conference,IMACC 2013.Lecture notes in computer science,vol 8308.Springer,Heidelberg,pp 28–44,2013.https://doi.org/10.1007/978-3-642-45239-0_3.)based on the BGV scheme.Unfortunately,their implementation faced significant limitations due to the exceedingly high multiplicative depth,rendering it impractical.Recently,a homomorphic implementation of SHA-256 based on the TFHE scheme(Homomorphic evaluation of SHA-256.https://github.com/zama-ai/tfhe-rs/tree/main/tfhe/examp les/sha256_bool)brings it from theory to reality,however,its current efficiency remains insufficient.In this paper,we revisit the homomorphic evaluation of the SHA-256 hash function in the context of TFHE,further reducing the reliance on gate bootstrapping and enhancing evaluation latency.Specifically,we primarily utilize ternary gates to reduce the number of gate bootstrappings required for logic functions in message expansion and addition of modulo 232 in iterative compression.Furthermore,we demonstrate that our optimization techniques are applicable to the Chinese commercial cryptographic hash SM3.Finally,we give specific comparative implementations based on the TFHE-rs library.Experiments demonstrate that our optimization techniques lead to an improvement of approximately 35–50%compared with the state-of-the-art result under different cores.展开更多
Sorting the Tibetan language quickly and accurately requires first identifying the component elements that make up Tibetan syllables and then sorting by the priority of the component.Based on the study of Tibetan text...Sorting the Tibetan language quickly and accurately requires first identifying the component elements that make up Tibetan syllables and then sorting by the priority of the component.Based on the study of Tibetan text structure,grammatical rules and syllable structure,we present a structurebased Tibetan syllable recognition method that uses syllable structure instead of grammar.This method avoids complicated Tibetan grammar and recognizes the components of Tibetan syllables simply and quickly.On the basis of identifying the components of Tibetan syllables,a Tibetan syllable sorting algorithm that conforms to the language sorting rules is proposed.The core of the Tibetan syllable sorting algorithm is a hash function.Research has found that the sorting of all legal Tibetan syllables requires eight components of information.The hash function is based on this discovery and can be assigned corresponding weights according to different sorting verify the effectiveness of the Tibetan sorting algorithm,we established an experimental corpus using the Tibetan sorting standard document recognized by the majority of Tibetan users,namely the New Tibetan Orthographic Dictionary.Experiments show that this method produces results completely consistent with standard reference works,with an accuracy of 100%,and with minimal computational time.展开更多
As quantum computing continues to advance,traditional cryptographic methods are increasingly challenged,particularly when it comes to securing critical systems like Supervisory Control andData Acquisition(SCADA)system...As quantum computing continues to advance,traditional cryptographic methods are increasingly challenged,particularly when it comes to securing critical systems like Supervisory Control andData Acquisition(SCADA)systems.These systems are essential for monitoring and controlling industrial operations,making their security paramount.A key threat arises from Shor’s algorithm,a powerful quantum computing tool that can compromise current hash functions,leading to significant concerns about data integrity and confidentiality.To tackle these issues,this article introduces a novel Quantum-Resistant Hash Algorithm(QRHA)known as the Modular Hash Learning Algorithm(MHLA).This algorithm is meticulously crafted to withstand potential quantum attacks by incorporating advanced mathematical and algorithmic techniques,enhancing its overall security framework.Our research delves into the effectiveness ofMHLA in defending against both traditional and quantum-based threats,with a particular emphasis on its resilience to Shor’s algorithm.The findings from our study demonstrate that MHLA significantly enhances the security of SCADA systems in the context of quantum technology.By ensuring that sensitive data remains protected and confidential,MHLA not only fortifies individual systems but also contributes to the broader efforts of safeguarding industrial and infrastructure control systems against future quantumthreats.Our evaluation demonstrates that MHLA improves security by 38%against quantumattack simulations compared to traditional hash functionswhilemaintaining a computational efficiency ofO(m⋅n⋅k+v+n).The algorithm achieved a 98%success rate in detecting data tampering during integrity testing.These findings underline MHLA’s effectiveness in enhancing SCADA system security amidst evolving quantum technologies.This research represents a crucial step toward developing more secure cryptographic systems that can adapt to the rapidly changing technological landscape,ultimately ensuring the reliability and integrity of critical infrastructure in an era where quantum computing poses a growing risk.展开更多
基金National Natural Science Foundation of China(62472397)Innovation Program for Quantum Science and Technology(2021ZD0302902)。
文摘Recently,several PC oracle based side-channel attacks have been proposed against Kyber.However,most of them focus on unprotected implementations and masking is considered as a counter-measure.In this study,we extend PC oracle based side-channel attacks to the second-order scenario and successfully conduct key-recovery attacks on the first-order masked Kyber.Firstly,we analyze the potential joint information leakage.Inspired by the binary PC oracle based attack proposed by Qin et al.at Asiacrypt 2021,we identify the 1-bit leakage scenario in the masked Keccak implementation.Moreover,we modify the ciphertexts construction described by Tanaka et al.at CHES 2023,extending the leakage scenario from 1-bit to 32-bit.With the assistance of TVLA,we validate these leakages through experiments.Secondly,for these two scenarios,we construct a binary PC oracle based on t-test and a multiple-valued PC oracle based on neural networks.Furthermore,we conduct practical side-channel attacks on masked Kyber by utilizing our oracles,with the implementation running on an ARM Cortex-M4 microcontroller.The demonstrated attacks require a minimum of 15788 and 648 traces to fully recover the key of Kyber768 in the 1-bit leakage scenario and the 32-bit leakage scenario,respectively.Our analysis may also be extended to attack other post-quantum schemes that use the same masked hash function.Finally,we apply the shuffling strategy to the first-order masked imple-mentation of the Kyber and perform leakage tests.Experimental results show that the combination strategy of shuffling and masking can effectively resist our proposed attacks.
基金The Project of Wireless Intelligence Terminal Inspection Services(No.6704000084)the Special Program of the NationalDevelopment and Reform Committee
文摘In order to meet the needs of higher operation speed and lower energy consumption an optimized SHA-1 algorithm is proposed.It combines two methods loop-unfolding and pre-processing.In the process intermediate variables are introduced in the iterations and pre-calculated so that the original single-threading operation can perform in a multi-threading way.This optimized algorithm exploits parallelism to shorten the critical path for hash operations.And the cycles of the original algorithm are reduced from 80 to 41 which greatly improves the operation speed.Therefore the shortened iterations of the optimized design require a smaller amount of hardware resource thus achieving a lower energy consumption. The optimized algorithm is implemented on FPGA field programmable gate array .It can achieve a throughput rate of 1.2 Gbit /s with the maximum clock frequency of 91 MHz reaching a fair balance between operation speed and throughput rate.The simulation results show that compared with other optimized SHA-1 algorithms this algorithm obtains higher operation speed and throughput rate without compromising the security of the original SHA-1 algorithm.
基金Project supported by the National Natural Science Foundation of China (Grant No.60973109)
文摘The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions.
基金supported by Key Program of Natural Science Fund of Tianjin of China (Grant No 07JCZDJC06600)
文摘The design of an efficient one-way hash function with good performance is a hot spot in modern cryptography researches. In this paper, a hash function construction method based on cell neural network with hyper-chaos characteristics is proposed. First, the chaos sequence is gotten by iterating cellular neural network with Runge Kutta algorithm, and then the chaos sequence is iterated with the message. The hash code is obtained through the corre- sponding transform of the latter chaos sequence. Simulation and analysis demonstrate that the new method has the merit of convenience, high sensitivity to initial values, good hash performance, especially the strong stability.
基金the National Natural Science Foundationof China(Nos.60573032,60773092,90604036)the National High Technology Research and Development Program(863)of China(No.2007AA01Z456)
文摘Multivariate hash functions are a type of hash functions whose compression function is explicitly defined as a sequence of multivariate equations. Billet et al designed the hash function MQ-HASH and Ding et al proposed a similar construction. In this paper, we analyze the security of multivariate hash functions and conclude that low degree multivariate functions such as MQ-HASH are neither pseudo-random nor unpredictable. There may be trivial collisions and fixed point attacks if the parameters of the compression function have been chosen. And they are also not computation-resistance, which makes MAC forgery easily.
基金Project supported by the Natural Science Foundation of Jiangsu Province, China (Grant No. BK2010526)the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20103223110003)The Ministry of Education Research in the Humanities and Social Sciences Planning Fund, China (Grant No. 12YJAZH120)
文摘A novel scheme to construct a hash function based on a weighted complex dynamical network （WCDN） generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency.
基金Project supported by the Natural Science Foundation of Hunan Province,China (Grant No 08JJ4020)
文摘A new one-way hash function based on the unified chaotic system is constructed. With different values of a key parameter, the unified chaotic system represents different chaotic systems, based on which the one-way hash function algorithm is constructed with three round operations and an initial vector on an input message. In each round operation, the parameters are processed by three different chaotic systems generated from the unified chaotic system. Feed-forwards are used at the end of each round operation and at the end of each element of the message processing. Meanwhile, in each round operation, parameter-exchanging operations are implemented. Then, the hash value of length 160 bits is obtained from the last six parameters. Simulation and analysis both demonstrate that the algorithm has great flexibility, satisfactory hash performance, weak collision property, and high security.
基金supported by the National Natural Science Foundation of China (Grant No 60372061)
文摘A new Hash function based on the generalized Henon map is proposed. We have obtained a binary sequence with excellent pseudo-random characteristics through improving the sequence generated by the generalized Henon map, and use it to construct Hash function. First we divide the message into groups, and then carry out the Xor operation between the ASCII value of each group and the binary sequence, the result can be used as the initial values of the next loop. Repeat the procedure until all the groups have been processed, and the final binary sequence is the Hash value. In the scheme, the initial values of the generalized Henon map are used as the secret key and the messages are mapped to Hash values with a designated length. Simulation results show that the proposed scheme has strong diffusion and confusion capability, good collision resistance, large key space, extreme sensitivity to message and secret key, and it is easy to be realized and extended.
基金Project supported by NSFC(Grant Nos.U1836205,61702040)the Major Scientific and Technological Special Project of Guizhou Province(Grant No.20183001)+2 种基金the Foundation of Guizhou Provincial Key Laboratory of Public Big Data(Grant No.2018BDKFJJ016)the Foundation of State Key Laboratory of Public Big Data(Grant No.2018BDKFJJ018)Beijing Natural Science Foundation(Grant No.4174089).
文摘To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication schemes are being faced with big challenges.We take the message authentication as an example into a careful consideration.Then,we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication function.Firstly,the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values,which ensures that the initial message can resist eavesdropping attack.Secondly,utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties,such as one-wayness,resisting different collisions and easy implementation.Based on these two points,the message authentication scheme can be much more secure than previous ones.Finally,it is a new way to design the message authentication scheme,which provides a new thought for other researchers in the future.Our works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future.
基金the National Natural Science Foundation of China (No. 60573028)
文摘For the 64 most basic ways to construct a hash function H:{0,1} → {0,1}n from a block cipher E:{0,1}n × {0,1}n → {0,1}n, Black et al.provided a formal and quantitative treatment of the 64 constructions, and proved that 20 schemes are collision resistant.This paper improves the upper and lower bounds and make contrast with a hash constructed from a random oracle.These 20 schemes have only one kind of collision resistance upper and lower bounds.In addition, we present new advantages for finding second preimages.
基金Supported by the National High Technology Research and Development Program of China (863 Program) ( 2007AA01Z411)the National Natural Science Foundation of China ( 60673071, 60970115 )
文摘This paper presents a fast pseudorandom generation algorithm,which is based on the BLAKE hash function and can pass the random test of the NIST(National Institute of Standards and Technology)Statistical Test Suite.Through theoretical analysis and experimental imitation,our new algorithm is proven to be more secure and efficient than G-SHA1.Simultaneously,we introduce and discuss the BLAKE in detail.Its security shows that can be utilized to generate pseudorandom bit sequences,which the experimental results show the BLAKE hash function has excellent pseudorandomness.Therefore,we believe the BLAKE is one of the most potential candidate algorithms of SHA-3 program.
基金Supported by the National Natural Science Foundation of China （No. 61173178, 61003247, 61070246） and the Fundamental Research Funds for the Central University （No. COJER1018002,cdjerl018003）.
文摘A new algorithm for a novel hash function, based on chaotic tent map with changeable parameter, is proposed and analyzed. The one dimensional and piecewise tent map with changeable parameters decided by the position index of blocked messages is chosen, and blocked massages translated into ASCII code values are employed as the iteration time of the chaotic tent map. The final 128-bit hash value is generated by logical XOR operation on intermediate hash values. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function.
文摘Message integrity is found to prove the transfer information of patient in health care monitoring system on the human body in order to collect and communicate the human personal data. Wireless body area network (WBAN) applications are the fast growing technology trend but security and privacy are still largely ignored, since they are hard to achieve given the limited computation and energy resources available at sensor node level. In this paper, we propose simple hash based message authentication and integrity code algorithm for wireless sensor networks. We test the proposed algorithm in MATLAB on path loss model around the human body in two scenarios and compare the result before and after enhancement and show how sensors are connected with each other to prove the message integrity in monitoring health environment.
文摘When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance.
基金Project supported by the National Natural Science Foundation of China (Grant No. U0735004)the Natural Science Foundation of Guangdong Province,China (Grant No. 05006593)
文摘Based on the spatiotemporal chaotic system, a novel algorithm for constructing a one-way hash function is proposed and analysed. The message is divided into fixed length blocks. Each message block is processed by the hash compression function in parallel. The hash compression is constructed based on the spatiotemporal chaos. In each message block, the ASCII code and its position in the whole message block chain constitute the initial conditions and the key of the hash compression function. The final hash value is generated by further compressing the mixed result of all the hash compression vulues. Theoretic analyses and numerical simulations show that the proposed algorithm presents high sensitivity to the message and key, good statistical properties, and strong collision resistance.
文摘Hash functions are often used in the authentication of information security field. With the development of electronic commerce, the reliability of authentication is paid more and more attention to. This paper describes an N - LFSR which combined nonlinear S - box with the LF-SR, and substitutes it for CLS operator in hash function. The efficiency of new hash function is not drop and the ability of defence attack is strengthened.
基金supported by the Program for New Century Excellent Talents in University of China(No.NCET-06-0510)National Natural Science Founda-tion of China(No. 60874091)Six Projects Sponsoring Talent Summits of Jiangsu Province(No. SJ209006)
文摘In this paper,based on coupled network generated by chaotic logarithmic map,a novel algorithm for constructing hash functions is proposed,which can transform messages and can establish a mapping from the transformed messages to the coupled matrix of the network.The network model is carefully designed to ensure the network dynamics to be chaotic.Through the chaotic iterations of the network,quantization and exclusive-or (XOR) operations,the algorithm can construct hash value with arbitrary length.It is shown by simulations that the algorithm is extremely sensitive to the initial values and the coupled matrix of the network,and has excellent performance in one-way,confusion and diffusion,and collision resistance.
基金supported by the Huawei Technologies Co.,Ltd and CAS Project for Young Scientists in Basic Research Grant No.YSBR-035.
文摘Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption.The earliest attempt to achieve homomorphic evaluation of SHA-256 hash function was proposed by Mella and Susella(in:Cryptography and coding—14th IMA international conference,IMACC 2013.Lecture notes in computer science,vol 8308.Springer,Heidelberg,pp 28–44,2013.https://doi.org/10.1007/978-3-642-45239-0_3.)based on the BGV scheme.Unfortunately,their implementation faced significant limitations due to the exceedingly high multiplicative depth,rendering it impractical.Recently,a homomorphic implementation of SHA-256 based on the TFHE scheme(Homomorphic evaluation of SHA-256.https://github.com/zama-ai/tfhe-rs/tree/main/tfhe/examp les/sha256_bool)brings it from theory to reality,however,its current efficiency remains insufficient.In this paper,we revisit the homomorphic evaluation of the SHA-256 hash function in the context of TFHE,further reducing the reliance on gate bootstrapping and enhancing evaluation latency.Specifically,we primarily utilize ternary gates to reduce the number of gate bootstrappings required for logic functions in message expansion and addition of modulo 232 in iterative compression.Furthermore,we demonstrate that our optimization techniques are applicable to the Chinese commercial cryptographic hash SM3.Finally,we give specific comparative implementations based on the TFHE-rs library.Experiments demonstrate that our optimization techniques lead to an improvement of approximately 35–50%compared with the state-of-the-art result under different cores.
基金This work was supported by the National Natural Science Foundation of China(No.61862054)Applied Basic Research Project of Qinghai Province(No.2019-ZJ-7066).
文摘Sorting the Tibetan language quickly and accurately requires first identifying the component elements that make up Tibetan syllables and then sorting by the priority of the component.Based on the study of Tibetan text structure,grammatical rules and syllable structure,we present a structurebased Tibetan syllable recognition method that uses syllable structure instead of grammar.This method avoids complicated Tibetan grammar and recognizes the components of Tibetan syllables simply and quickly.On the basis of identifying the components of Tibetan syllables,a Tibetan syllable sorting algorithm that conforms to the language sorting rules is proposed.The core of the Tibetan syllable sorting algorithm is a hash function.Research has found that the sorting of all legal Tibetan syllables requires eight components of information.The hash function is based on this discovery and can be assigned corresponding weights according to different sorting verify the effectiveness of the Tibetan sorting algorithm,we established an experimental corpus using the Tibetan sorting standard document recognized by the majority of Tibetan users,namely the New Tibetan Orthographic Dictionary.Experiments show that this method produces results completely consistent with standard reference works,with an accuracy of 100%,and with minimal computational time.
基金Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2025R343),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabiathe Deanship of Scientific Research at Northern Border University,Arar,Saudi Arabia for funding this research work through the project number NBU-FFR-2025-1092-10.
文摘As quantum computing continues to advance,traditional cryptographic methods are increasingly challenged,particularly when it comes to securing critical systems like Supervisory Control andData Acquisition(SCADA)systems.These systems are essential for monitoring and controlling industrial operations,making their security paramount.A key threat arises from Shor’s algorithm,a powerful quantum computing tool that can compromise current hash functions,leading to significant concerns about data integrity and confidentiality.To tackle these issues,this article introduces a novel Quantum-Resistant Hash Algorithm(QRHA)known as the Modular Hash Learning Algorithm(MHLA).This algorithm is meticulously crafted to withstand potential quantum attacks by incorporating advanced mathematical and algorithmic techniques,enhancing its overall security framework.Our research delves into the effectiveness ofMHLA in defending against both traditional and quantum-based threats,with a particular emphasis on its resilience to Shor’s algorithm.The findings from our study demonstrate that MHLA significantly enhances the security of SCADA systems in the context of quantum technology.By ensuring that sensitive data remains protected and confidential,MHLA not only fortifies individual systems but also contributes to the broader efforts of safeguarding industrial and infrastructure control systems against future quantumthreats.Our evaluation demonstrates that MHLA improves security by 38%against quantumattack simulations compared to traditional hash functionswhilemaintaining a computational efficiency ofO(m⋅n⋅k+v+n).The algorithm achieved a 98%success rate in detecting data tampering during integrity testing.These findings underline MHLA’s effectiveness in enhancing SCADA system security amidst evolving quantum technologies.This research represents a crucial step toward developing more secure cryptographic systems that can adapt to the rapidly changing technological landscape,ultimately ensuring the reliability and integrity of critical infrastructure in an era where quantum computing poses a growing risk.
