Applications

Comments

• SkybreakerEngineer@lemmy.world ⁨7⁩ ⁨months⁩ ago

  Applications like most of cryptography?

  source

  • xthexder@l.sw0.com ⁨7⁩ ⁨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)

    source
  • ThisIsAManWhoKnowsHowToGling@lemmy.dbzer0.com ⁨7⁩ ⁨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

    source
• Dalvoron@lemm.ee ⁨7⁩ ⁨months⁩ ago

  *numbers that are the product of exactly two prime factors

  source

  • Xavienth@lemmygrad.ml ⁨7⁩ ⁨months⁩ ago

    Presumably if they’re the product of exactly two factors then those factors would have to be prime, otherwise it wouldn’t be exactly two.

    source

    • Dalvoron@lemm.ee ⁨7⁩ ⁨months⁩ ago

      Well primes themselves are the product of exactly two factors, only one of which is prime, so we need to specify semi primes as having exactly two prime factors.

      source

      • -> View More Comments