• xthexder@l.sw0.com
      link
      fedilink
      English
      arrow-up
      11
      ·
      2 months ago

      Yes, but also no. We use giant prime numbers for cryptography because the more factors it has, the weaker the encryption becomes (because now there’s more than one answer for A * ? = B)

    • Wugmeister@lemmy.dbzer0.com
      link
      fedilink
      English
      arrow-up
      7
      ·
      2 months ago

      This actually is the main application for 2-almost primes. For example, instead of having an arbitrarily large prime be used for the hash, you could use a very large 2-almost prime as a key with its factors being used as 2 layers of hashing. I know there’s better uses, but the more I try to learn about cryptography the more confused I get

  • Dalvoron@lemm.ee
    link
    fedilink
    English
    arrow-up
    13
    arrow-down
    1
    ·
    2 months ago

    *numbers that are the product of exactly two prime factors