Cayley–Purser algorithm: Difference between revisions

Content deleted Content added
Adding local short description: "1999 public-key cryptography algorithm", overriding Wikidata description "algorithm" (Shortdesc helper)
commutative property, not some inverse thing
 
(One intermediate revision by one other user not shown)
Line 35:
This group is chosen because it has large order (for large semiprime ''n''), equal to (''p''<sup>2</sup>−1)(''p''<sup>2</sup>−''p'')(''q''<sup>2</sup>−1)(''q''<sup>2</sup>−''q'').
 
Let <math>\chi</math> and <math>\alpha</math> be two such matrices from GL(2,''n'') chosen such that <math>\chi\alpha^{-1} \not= \alpha\chi</math>. Choose some natural number ''r'' and compute:
 
:<math>\beta = \chi^{-1}\alpha^{-1}\chi,</math>
Line 89:
{{DEFAULTSORT:Cayley-Purser algorithm}}
[[Category:Public-key encryption schemes]]
[[Category:Broken cryptography algorithms]]