Post #4134471
2026-07-27 08:56 UTC
@FishFace@ioc.exchange Shor’s algorithm, on the other hand, is impossible to implement at scale in ordinary hardware. Thus it cannot break RSA on an ordinary computer, either hybrid or digital.
Therefore I am looking for other methods of factorization based on maxent.
Replies (1)
-
@chemoelectric@masto.ai 2026-07-27 09:03
@FishFace@ioc.exchange It is worth noting that if the size of the search space is limited to the size of an array in memory then its logarithm is bounded by the size of a register and so should be regarded as constant-bounded. But Grover’s algorithm in practice converges so quickly that it hardly matters. The usual analyses are practically worst case instances. I actually had three of the item in the array, which is supposed to be bad for Grover’s algorithm, but it took only two iterations, not 804.