Cayley–Purser algorithm: Difference between revisions

Content deleted Content added
m Typo fixing , typos fixed: sytem → system using AWB
The number of solutions depends on |Cent(χ)|, which depends on the order of χ, since <χ> <= Cent(χ).
Line 67:
== Security ==
 
Recovering the private key <math>\chi</math> from <math>\gamma</math> is computationally infeasible, at least as hard as finding square roots mod ''n'' (see [[quadratic residue]]). It could be recovered from <math>\alpha</math> and <math>\beta</math> if the system <math>\chi\beta = \alpha^{-1}\chi</math> could be solved, but the number of solutions to this system is large as long as theelements matrixin the group hashave a large order, which wecan ensuredbe guaranteed for almost every element.
 
However, the system was broken when a method for finding a multiple <math>\chi'</math> of <math>\chi</math> using the public parameters by solving the congruence: