Approved safe key stream generator based on multivariate quadratic equation

Abstract

The invention designs a key stream generator which can be used for computing the output pseudo-random sequence with random length under the condition of low resource consumption, and the generating algorithm of the key stream generator can be approved to be safe; the safety of the key stream generator is based on the difficulty of solving multivariate quadratic equation set within a finite field and can meet the design demand of the approved safe key stream generator, so that the key stream generator can be applied to the field with higher requirement for the safety. In one instance, the key stream generator is defined by multivariate multinomial set on one GF (q), and the q is large prime number. By selecting proper parameter, key stream with random bit can be generated at higher speed according to the length of plaintext, and the safety level of 2<80> can be reached, so that the key stream generator can meet the application need of most current passwords.

Description

technical field [0001] The present invention relates to cryptography, and in particular to a provably safe key stream generator. Furthermore, since both random algorithms and modern network communication techniques require frequent use of random sequences, the present invention also relates to these fields. Background technique [0002] The present invention is based on the theory of provably safe cryptography, and in this sense, the research background of the key stream generator is described. [0003] Many cryptographic algorithms need to use long enough random sequences to ensure security, but the cost of obtaining long random sequences is often high, and in practical applications, pseudo-random sequences generated by algorithms are often used instead. This algorithm designs a pseudo-random sequence generation algorithm, usually called a key stream generator. Intuitively, a keystream generator is a deterministic algorithm that accepts a short initial internal state and ...

AI Technical Summary

Problems solved by technology

When m=n, q=2, the complexity of the existing best solution algorithm is and poor search complexity 2 n is very close, and for a random instance of n values ​​over 100, it is completely beyond the existing computing power

Since polynomial iteration only needs polynomial evaluation calculation, the cryptographic algorithm based on this problem is often efficient; higher field

Images