Login
You're viewing the functional.cafe public feed.
  • Nov 8, 2026, 8:11 PM
    @divVerent@vivaldi.net My code does kinda "bruteforce" until (p-1)(q-1) doesn't share any factors with the public exponent, because that's a requirement for RSA... but it has always finished in one attempt so far.
    💬 1🔄 0⭐ 1

Replies

  • Nov 8, 2026, 8:31 PM

    @nothacking Yeah, you need that too, but it's basically irrelevant for security of your cert. Just important for it to work ;)

    💬 0🔄 0⭐ 0
  • 💬 0🔄 0⭐ 0
  • Nov 8, 2026, 10:41 PM
    @assimilateborg@kind.social @divVerent@vivaldi.net From what I've seen, LE will sign anything that doesn't have factors smaller than one thousand... but there's no way to actually use the resulting certificate without having the private exponent which is derived from the two primes.
    💬 1🔄 0⭐ 0
  • Nov 9, 2026, 5:39 AM

    @nothacking @assimilateborg There is, multi-prime RSA is a thing.

    But you then have to compute the private exponent differently. Otherwise your key simply won't _work_. And you can't store the private key in the usual formats that are used for 2-prime RSA, as the CRT parameters will work differently.

    LE or another CA can't detect if you did that or not, and in fact, multi-prime RSA is actually a thing.

    💬 0🔄 0⭐ 0