Multiple Random Composite Public Key Encryption Generator

In this paper, we study the multiple random composite public key encryption gener-ator and the nonlinear generalized self shrinking sequence model.Multiple random composite public key encryption generator solves the difficulties of the key exchange in a safe way before the communication,and solves the bottleneck what the sequence password can not lie applied to the digital signature and the identification. Multiple random composite public key encryption generator is easy to be upgraded and maintained.It increases the security of communication, enhances the ability to resist attack-s. and overcomes the defects of time-consuming decryption of the traditional asymmetric key system.Nonlinear generalized self shrinking sequence is a new type of sequence model, which has more complex forms and is more difficult to research. The research shows that the period of the nonlinear generalized self shrinking sequence based on primitive polynomial is large and the balance is strong, which increases the security and increases security against attacks. So the nonlinear generalized self shrinking sequence is suitable for the wide application in the field of information security.If the nonlinear generalized self shrinking sequence is applied to the multiple random composite public key encryption generator,it can enrich the encryption library.That makes the encryption generator more secure and reliable.