Research on Collision-free High-efficiency Pseudo-random Sequence Generation Algorithm

To overcome the shortcomings of the current popular conflict-free generation algorithm for pseudo-random sequences, a new conflict-free and efficient random permutation generation algorithm is presented. At the same time, it also introduces two other classical pseudo-random sequences generation algorithms, Hash algorithm and GUID algorithm. Compare the performance of the three algorithms by calculating time complexity and recording time consumption. The results show that the random permutation generation algorithm has high time efficiency and is more suitable for generating large amounts of conflict-free pseudo-random sequence.