4 ms·
First, cracking RSA is not believed to be NP complete. Second, even if it were, an analog computer could in theory provide a large constant factor speed up that
by im3w1l 6y ago
First, cracking RSA is not believed to be NP complete. Second, even if it were, an analog computer could in theory provide a large constant factor speed up that would break current key sizes. But still, it seems very unlikely that an analog computer breaks RSA.