A New Authentication Encryption Scheme Based On Multi-prime RSA

RSA is a crucial and significant public-key cryptosystem. From the birth on, RSA has always being applied for its excellent performance of high security and convenient usage and so on. With the development of science and technology, RSA is faced on its bottle-neck. The length of key is increasing, which reduces the encryption and decryption efficiency of systems greatly.In this paper, a new authentication encryption scheme based on multi-private-key RSA and the Chinese remainder theorem (CRT) is proposed. The difference from usual encryption system is that each user has only one encryption key, and the decryption key is composed of over two short keys. What's more, during decryption process, CRT is used artfully, thus, the number of multiplicable reverse is decreased. So the benefit of decryption is improved faster greatly. Specially, improved Paixao scheme and Boneh scheme can be obtained from this paper, which achieves high efficiency. Analysis shows that the scheme can reduce the computing complexity and would not reduce it's security performance.Last, a prototype system of this scheme is implemented by the very popular object-oriented software development language Visual C++6.0.