Anonymous user
Talk:Cipolla's algorithm: Difference between revisions
ω precision
(ω precision) |
|||
Line 7:
:: Ah, now it's '''Step 2. Let ω² = a² - n. Compute, in Fp2 : (a + ω) ^ ((p + 1)/2) (mod p)''' where we need to find ω given ω².
:: But that does not eliminate the problem of how do we find ω given ω². (Ok, granted, if we had a way of finding a+ω, that would suffice, but I'm not seeing that at the moment -- and if there's an obvious way of finding that value, I think that that should be specified as a part of the algorithm. If not, I imagine that that should be eliminated from the algorithm.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 17:42, 26 March 2016 (UTC)
::: You do not have to find a value for ω. This is impossible (since ω² is not a square) and not requested by the task . For example, say ω² = -6 . (3 + ω) ^ 2 = 9 - 6 + 3 ω + 3 ω = 3 + 6 ω . --[[User:G.Brougnard|G.Brougnard]] ([[User talk:G.Brougnard|talk]]) 18:21, 26 March 2016 (UTC)
| |||