Light can compute linear transformations with high bandwidth: https://phys.org/news/2021-09-desired-linear-digital-processor.html
Is there any way to apply this to factorizing integers? I saw a post discussing this a while back on /g/ and someone claimed to have broken RSA. Neither of the anons revealed exactly how they claimed to do it, but implied it was using this method.
Is there any way to apply this to factorizing integers? I saw a post discussing this a while back on /g/ and someone claimed to have broken RSA. Neither of the anons revealed exactly how they claimed to do it, but implied it was using this method.
