[Cryptography] Has quantum cryptanalysis actually achieved anything?

[Peter Fairbrother]

On 20/02/2025 07:57, Jon Callas wrote:
[...]
>
> As a factoid, the special forms that 15 and 21 have is that they're 2^n-1 * 2^n+1 -- so a string of 1 bits times a high bit, a bunch of zero bits, and then the low bit.

So, don't use prime pairs for RSA? Just in case...

Personally I'd use safe* primes, none of this 128- or whatever- bit
factors of p-1, avoiding unnecessary structure; and there aren't any**
pairs of safe primes



Peter Fairbrother

* (p-1)/2 is also prime
** apart from 5 and 7