In theory, with long-enough (perhaps too long for practical use) RSA
keys, conventional factoring would be /easier/ than Shor's algorithm. Is
there such a "turnover" point?
When talking about science fiction technologies, the only answer is "who
knows?" You'll hear me say that a lot here.
If
On 1/2/25 22:59, Robert J. Hansen wrote:
Do I understand correctly that, while the complexity of
conventional factoring scales with a logarithm of RSA key length,
Shor's algorithm has a space requirement that scales linearly, but
the engineering challenges implied by that linear growth scale
expo
Breaking RSA-4096 via Shor's algorithm is straight out of science
fiction.
No, *this* is science fiction:
I stand by my statement. RSA-4096 via Shor's requires science fiction
level technology advances.
Signal is acting ethically and responsibly: They have had hybrid-PQC
fully deployed to
This is a followup on infrastructure support for PQ-PGP keys.
On Wed, 1 Jan 2025 23:57:25 +, h...@anonymous.sex wrote:
I attempted to upload a post-quantum key created with GnuPG v2.5.1 to
keys.openpgp.org. [...] I promptly reached out to supp...@keys.openpgp.org
to ask when the infrastr
On Thu, 2 Jan 2025 19:25:01 -0500, Robert J. Hansen
wrote:
Breaking RSA-4096 via Shor's algorithm is straight out of science
fiction.
No, *this* is science fiction: It’s been known since 1977 that
factoring is merely an O(log n) problem, easy-peasy, if you have a
(classical) computer with
