Abstract
RSA is one of the most popular encryption algorithm. It can encrypt the data for secrecy and also give signatures for authenticity. The algorithm has suffered many attacks and hasn't been broken completely. In this paper an improved RSA algorithm is analyzed based on Chinese Remainder Theorem to solve the problem of its speed. It not only increases the security but also improves the speed of decryption. Using the improved RSA and DES algorithm, we construct a cryptosystem containing the certification, protecting the public key and digital signatures. The possible attacks are analysed and some advice is given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
