A Generic Model of the Pseudo-Random Generator Based on Permutations Suitable for Security Solutions in...

Area of Science:

• Computer Science
• Cryptography
• Information Theory

Background:

• Symmetric cryptography is crucial for data protection.
• Pseudo-random generators significantly impact security solution effectiveness.
• Security efficiency is vital in computationally constrained environments.

Purpose of the Study:

• To design a novel, efficient pseudo-random generator.
• To analyze the generator's characteristics using probabilistic, information-theoretic, and number theory methods.

Main Methods:

• Probabilistic analysis
• Information-theoretic analysis
• Number theory methods

Main Results:

• Derived conditions for uniform output distribution.
• Established conditions for zero correlation between parameterizing and output sequences.
• Demonstrated that mutual information tends to zero as sequence length increases.
• Showed that the generated sequence period can significantly exceed parameterizing sequence periods.

Conclusions:

• The proposed pseudo-random generator exhibits desirable security characteristics.
• Efficiency can be achieved by using established generators like multiple linear feedback shift registers as parameterizing sequences.
• The design is suitable for security applications, especially in resource-constrained settings.