What is a use of Chinese remainder theorem in RSA?
Is it beneficial for us to use chinese remainder theorem in RSA?
Printable View
What is a use of Chinese remainder theorem in RSA?
Is it beneficial for us to use chinese remainder theorem in RSA?
Hmmm,
1. CRT also called RNS (residual number system) is used to speed up the decryption process in RSA.
2. Yes, it is efficient and speeds things up. That is why it is commonly used.
I seem to recall that depending on the implementation it can be vulnerable to hardware fault cryptanalysis and timing attacks.
http://www.cs.sjsu.edu/faculty/stamp...s/article.html
http://en.wikipedia.org/wiki/Timing_attack
Try using Google or similar to find articles on the subject, as it is far too complex to discuss on a forum such as this.
Hi
From the link given below i used to download Chillkat libraries to Generate RSA Public/Private Key Pair for Encryption (Key Exchange)
http://www.example-code.com/vcpp/rsa.asp
But the problem i have to face while using above link is that i could not be able to find any source file.After completion of download i just found some header files.Kindly do me favor to provide source files as well.
Important point here to mention is that i have WINDOW XP & i am using VC++ 6.0.
Regards
Unfortunately that is a commercial product ($270 per single developer license).
Its source code is subject to copyright and is not available.
But then please guide me about any other link where storage of 1024 bits for RSA is freely available ?
Regards