Content deleted Content added
→Archive and other stuff: Reply |
Jasper Deng (talk | contribs) →Encryption schemes not vulnerable to quantum computing: belated reply but |
||
Line 15:
::The first few lines of the description of the algorithm state that the number N '''cannot''' be the power of a prime (say P^Q). How difficult would it be to implement an encryption scheme that raised a prime number to a prime exponent? That would seem to solve the problem as well, wouldn't it? -- [[User:TheLastWordSword|TheLastWordSword]] ([[User talk:TheLastWordSword|talk]]) 22:21, 9 January 2014 (UTC)
:::{{ping|TheLastWordSword}} A power of prime, and any other perfect power for that matter, is trivial to factor by taking roots up to the log-base-2-of-Nth root of N, a polynomial time operation.--[[User:Jasper Deng|Jasper Deng]] [[User talk:Jasper Deng|(talk)]] 06:48, 19 October 2023 (UTC)
==Nature article==
| |||