Multi-asymmetric cryptographic RSA scheme
Ahmad Mansour, Andrew Davis, Matthew Wagner, Richard Bassous, Huirong Fu, Ye Zhu · 2017
In this paper, we propose a version of RSA encryption that uses the Chinese Remainder Theorem (CRT) for the purpose of concealing multiple plain-texts in one cipher-text. This scheme allows the sender to possibly send different information to multiple receivers, and each receiver is only able to decrypt the message intended for them. We prove the algorithm mathematically. Furthermore, we prove our algorithm secure against the chosen plain-text (CPA) attack. We also compare textbook RSA against our algorithm and show the security and size advantages. The new algorithm can also take advantage of current methods that speed up the decryption process of RSA. This scheme will become a basis for further one to many public key cryptosystems.