Hello, this is rather vague but I had a lecture around a year ago about prime numbers and how a mathematician (Hardy or Euler?) found a proof to do with prime numbers and then this lead on to cryptography and internet security...(adsbygoogle = window.adsbygoogle || []).push({});

That's all I can particularly remember but I'm wondering on what was the theorem or who was the mathematician that proved this specific "thing" which lead to the creation of cryptography.

Also I remember it had Modular arithmetic!

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prime numbers and cryptography

Loading...

Similar Threads for Prime numbers cryptography | Date |
---|---|

A Equation with three consecutive prime numbers | Apr 11, 2016 |

Largest Prime Number | Feb 6, 2013 |

A big number modulo a prime | Dec 12, 2012 |

Modulo and prime numbers | Nov 4, 2012 |

What are some applications of prime numbers other than cryptography | Sep 5, 2012 |

**Physics Forums - The Fusion of Science and Community**