Hi If u are asking as to why only prime numbers solve the mathematical theorems like Euler's corollary or Fermat's theorem then obviously its because of their basic nature. i dono what else is the reason
On 6/13/07, Bin Chen <[EMAIL PROTECTED]> wrote: > > > > > On Jun 13, 7:36 pm, "Raghav P" <[EMAIL PROTECTED]> wrote: > > Hi > > To cite an example , the RSA algorithm's working is based on the proof > of > > the corollary to Euler's theorem. This corollary uses 2 prime numbers > and > > hence RSA which derives its working from this theorem uses prime > numbers. > > This was just an example..similarly there is some mathematical basis for > > most cryptographic algorithms, the use of prime numbers in the > algorithms > > is because of the underlying mathematical theorem. > > Yes, I really know the basic reason. Most encrypt algorithm's aim is > to make the hacker can only decrypt the data by one method, which is > brute force. So prime can make sure this, I guess, but how prime sure > this? Which mathematical theorem can prove this? > > Thanks. > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
