Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

A virtually unbreakable code?

  1. May 25, 2015 #1
    Simple question. I understand that the product of two "large" primes is a nearly unbreakable code. How large is "large" and if it's that easy, why aren't big corporations using this?
     
  2. jcsd
  3. May 25, 2015 #2

    jedishrfu

    Staff: Mentor

  4. May 25, 2015 #3

    Mark44

    Staff: Mentor

    In essence, they are. One technique that's used is public key encryption, which relies on two keys -- a public key and a private key.

    "Unbreakable" is a relative term. Encryptions that were unbreakable by a single computer ten or twenty years ago were able to be broken using large networks of computers, each working in parallel to search for a factorization of a large composite number with two prime factors. As a result we've seen the keys get larger in size. See http://en.wikipedia.org/wiki/Key_size and http://en.wikipedia.org/wiki/Key_(cryptography).
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: A virtually unbreakable code?
  1. Virtual Caches (Replies: 5)

  2. Examples of code (Replies: 2)

  3. Code Blocks (Replies: 2)

  4. The Source Code! (Replies: 15)

Loading...