An unconditional security authentication method based on lfsr hash

Abstract

The invention discloses an unconditional security authentication method based on LFSR hash, which belongs to the field of information security. Aiming at the security in the hardware implementation environment existing in the prior art, the present invention provides an unconditional security authentication method based on LFSR hash, by adding a time stamp behind the bit string of valid information, the valid information can be In the case of removing the hash value of zero, this scheme can be implemented in p ( x ) can still obtain unconditional security under the premise of being disclosed, and greatly reduce the probability of security failure of hash authentication.

Description

technical field [0001] The invention relates to the field of information security, and more specifically, relates to an unconditional security authentication method based on LFSR hash suitable for quantum security systems. Background technique [0002] Message authentication technology is a technology that can identify the sender and receiver of information. It is the first door to protect information security. Its task is to identify and verify the legitimacy, authenticity and integrity of messages. , secure communication and other fields all play an indispensable role. There are many traditional authentication schemes, such as based on RSA, discrete logarithm, elliptic curve, etc., but these schemes only have computational security and are facing the threat of quantum computing. Therefore, exploring an efficient, practical and unconditionally secure hash authentication method has become an urgent problem in the field of information security. [0003] Wegman and Carte fir...

AI Technical Summary

Problems solved by technology

However, an irreducible polynomial of degree 128 has about 2 128 On the order of / 128, it is difficult to find them all and choose one at random

Therefore, the randomness of the irreducible polynomials selected in the actual use process is not high, and the security of the actual authentication is therefore limited.

[0005] Moreover, in the existing technology, such as the literature "Zhou Lei, Cheng Jie, Tang Shibiao. Research on high-speed QKD system authentication scheme based on Toeplitz matrix. Journal of Quantum Electronics, 2019, 36(3): 329-335" and "Cui Ke. Quantum key distribution real-time processing technology research. Anhui: University of Science and Technology of China, 2014 "In the authentication method based on LFSR hash used in ", in order to accelerate the calculation speed, the authentication process usually needs to be implemented by well-designed hardware, and the hardware structure During the design process, it is necessary to fix the irreducible polynomial in advance p ( x ) in the form of p ( x ) form is directly reflected in the general hardware structure, so p ( x ) is often known by the attacker, which directly violates the assumption of the security proof

Therefore, in the actual hardware environment, there are security loopholes in the existing technology

Images