Maybe an example will clarify this. Suppose I want to send a secret
message to a mate and you want to crack the message. The key is a big
number, which you intercepted. Cracking now means that you factorize
that number. So for example, if my key is 24 and you find out that 24
is 2*2*2*3 then you
On 6/19/07, Bin Chen [EMAIL PROTECTED] wrote:
On Jun 15, 9:36 pm, Bart [EMAIL PROTECTED] wrote:
Top post means you reply other's thread in the top of the content. It
is regard as a rude behavior when in USENET.
Because not only you will reply the thread, you must let others know
thanks bart, and again if someone checks his/her mail frequently then its
more important for him not the older mail but the newer one. So why we
should not prefer top post ?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
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
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
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
On Jun 13, 9:04 pm, Raghav P [EMAIL PROTECTED] wrote:
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
I'd like to suggest you don't
On 6/13/07, Bin Chen [EMAIL PROTECTED] wrote:
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?
I think it the it's the other way around! :-)
Since there isn't any really efficient way to prime factorize
