Talk:Cayley–Purser algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Cryptography: Computer science Low‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography
Low	This article has been rated as Low-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Low-importance).

Translation

Article: de:Cayley-Purser-Algorithmus
Corresponding English-language article: Cayley-Purser algorithm
Originally Requested by: — Matt 18:12, 27 Jul 2004 (UTC)
Status: Done by User:Mpolo
Other notes:

Jmabel 01:56, Sep 26, 2004 (UTC)

Need to write out the mathematics of the algorithm.

Added by anon; could somebody verify this?

The Cayley-Purser algorithm is famous, because it was orginally announced that is was a Public-key but it is really a Private-key(one-key,Symmetric key algorithm) cryptosystem, because too much information is leaked in the Cayley-Purser algorithm. -Sarah Flannery, "In Code" It can not securly function as a public and private key cryptosystem.

--Christopherlin 06:56, 20 December 2005 (UTC)[reply]