• njordomir
    link
    fedilink
    English
    arrow-up
    1
    ·
    1 hour ago

    What does this mean for encryption? I don’t see anyone talking about that here. Doesn’t encryption depend on large prime numbers to work? If there is a pattern, wouldn’t that break it?

    Please pardon my mathematical ignorance. In high school I took the easy math class referred to by the not-acceptable late 90s early 00s name of “r*tard math”

    • TapedeckNinjaOP
      link
      fedilink
      English
      arrow-up
      1
      ·
      56 minutes ago

      Basically nothing.

      Modern encryption (“post-quantum encryption”) is based on different math altogether anyway.

    • Email
      link
      fedilink
      English
      arrow-up
      1
      ·
      edit-2
      5 minutes ago

      It changes almost nothing. Testing a prime was already known, though this does prove another algorithm can too (Miller-Rabin). RSA cares about factorization not primality testing (and RSA does not nearly represent cryptography). RH solved proves a large number of statements that depended on it, but they are considered routine because RH was already assumed to be true.