Which Mathematicians Pioneered Prime Numbers for Cryptography?

[phospho]

Hello,

This may seem like a random question but I'm doing a essay on cryptography and I'm wondering if anyone could tell me who was the mathematician(s) that done the original work in prime numbers that lead to the development of cryptography and the RSA and whatnot.

Sorry if this is vague, but I have found no information on the mathematicians.

Thank you!

Edit: Step 4 of the RSA algorithm here: http://en.wikipedia.org/wiki/RSA_(algorithm)

who done the work to make it possible to find a number e such that 1 < e < phi(n) where e and phi(n) are coprime.

 

[ramsey2879]

Hello,

This may seem like a random question but I'm doing a essay on cryptography and I'm wondering if anyone could tell me who was the mathematician(s) that done the original work in prime numbers that lead to the development of cryptography and the RSA and whatnot.

prime numbers were known far back in time but only those mentioned in the article seemed to have thought up the RSA algorithm

Sorry if this is vague, but I have found no information on the mathematicians.

TRY searching for info on US patent 4405829

Edit: Step 4 of the RSA algorithm here: http://en.wikipedia.org/wiki/RSA_(algorithm)

who done the work to make it possible to find a number e such that 1 < e < phi(n) where e and phi(n) are coprime.

How to find a number n between 1 and X>2 such that n is coprime to X was known before the Roman calendar so I don't understand your question.

 

[ramsey2879]

Hello,

This may seem like a random question but I'm doing a essay on cryptography and I'm wondering if anyone could tell me who was the mathematician(s) that done the original work in prime numbers that lead to the development of cryptography and the RSA and whatnot.

Sorry if this is vague, but I have found no information on the mathematicians.

Thank you!

Edit: Step 4 of the RSA algorithm here: http://en.wikipedia.org/wiki/RSA_(algorithm)

who done the work to make it possible to find a number e such that 1 < e < phi(n) where e and phi(n) are coprime.

Wikipedia has a good history of ciphers: http://en.wikipedia.org/wiki/History_of_cryptography