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.
On 6/13/07, Bin Chen <[EMAIL PROTECTED]> wrote: > > > Hi, > > Many cryptography algorithm used prime to do the modular math, but I > don't know why it need to use prime but not many ordinary numbers? > > Thanks > Bin > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
