A) Yes, it is Cayley-Purser. As the first respondent, you win a free drink
at the conference, or, if you can't make it, contact me off list for an
equivalent, easy to ship prize of an as yet undetermined nature.
B) This is another miserable attempt at geek humor gone awry. That does
not, in any way, diminish my respect for you and Rick, who picked it out so
quickly.
C) Cayley-Purser is way more than 20 times faster than RSA.
Of course, the Mathematica code is lifted directly from Sarah Flannery's
paper.
I did, as Rick suggests, have harder stuff, but nothing handy in a format
that I could post to the list.
Cary
At 04:33 PM 10/3/2000 -0400, you wrote:
>Well Rijndael is the official AES algorithm.
>
>You can find more C examples of triple DES and
>RSA than you can shake a stick at (which means
>turning it into CFX is cake)
>
>Rijndael (yer right) is okay, Twofish is supposed
>to be stronger, RSA is now freed hehe.
>
>Anyways wheres my prize? :P.
>
>
>And yes CP is broken but it is 20 times faster
>and if not broken would be as secure as RSA :P
>
>Jeremy Allen
>[EMAIL PROTECTED]
>
>
>
>-----Original Message-----
>From: Rick Osborne (Mojo) [mailto:[EMAIL PROTECTED]]
>Sent: Tuesday, October 03, 2000 4:18 PM
>To: CF-Talk
>Cc: [EMAIL PROTECTED]
>Subject: RE: Harder Math Question (Cayley-Purser)
>
>
>It's the Cayley-Purser Algorithm for encryption. See:
>
>http://www.cayley-purser.ie/
>
>I thought this was a broken algorithm? Yes, no?
>
>As for translating it to CF, why? Why not just use RSA or Twofish or DES?
>(Or, if you want to be really topical, use Rijndael. (sp?)) The patent for
>RSA is over, and it has been released to the public. There are a dozen
>other pre-existing tags for encryption. Don't reinvent the wheel. :)
>
>-Rick
>
>P.S. - Next time try something a bit harder for a challenge. All that
>modulo and matrix math was a dead giveaway. ;)
>
>-----Original Message-----
>From: Cary Gordon [mailto:[EMAIL PROTECTED]]
>Sent: Tuesday, October 03, 2000 15:37
>To: CF-Talk
>Subject: OT: Harder Math Question
>
>
>Any idea of how I can turn this algorithm a custom tag? It is in
>Mathematica format as that is the only way I could think of to post it here.
>
>[...]
>
>I will award a meaningful, albeit insignificant, prize to the first poster
>who can identify, even in broad terms, the (quite useful) function of this
>algorithm.
>
>Cary
>
>----------------------------------------------------------------------------
>--
>Archives: http://www.mail-archive.com/[email protected]/
>To Unsubscribe visit
>http://www.houseoffusion.com/index.cfm?sidebar=lists&body=lists/cf_talk or
>send a message to [EMAIL PROTECTED] with 'unsubscribe' in
>the body.
>
>------------------------------------------------------------------------------
>Archives: http://www.mail-archive.com/[email protected]/
>To Unsubscribe visit
>http://www.houseoffusion.com/index.cfm?sidebar=lists&body=lists/cf_talk or
>send a message to [EMAIL PROTECTED] with 'unsubscribe' in
>the body.
------------------------------------------------------------------------------
Archives: http://www.mail-archive.com/[email protected]/
To Unsubscribe visit
http://www.houseoffusion.com/index.cfm?sidebar=lists&body=lists/cf_talk or send a
message to [EMAIL PROTECTED] with 'unsubscribe' in the body.
