Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:03
Gary Howland (gary@hotlava.com)
14 Jan 1999 16:43:47 -0000
This sounds like it is not a new algorithm, but rather an
alternative method of encoding the key and data to obtain
a performance gain at the expense of precomputation and memory.
I say this due to reports that the key and encrypted data are
eight times longer than normal. Also, I have heard that
encryption takes the same time as decryption, which is unusual
for RSA, since it is usually only the decryption that is slow.
Some news posts also report the use of 2x2 matrices, 16
multiplications for encryption, and 17 multiplications for
decryptions (!)
It is well known that some techniques such as exponent recoding
can be used to speed up exponentiation and suchlike, although
I must admit that I haven't heard of *any* technique that
doesn't involve at least some exponentiation for RSA, since,
unlike algorithms such as El Gamal, the base is not fixed, and
therefore values cannot be pre-computed. However, one news post
implied that only multiplications were needed. Also, it is
difficult to make effective use of exponent recoding for RSA,
since in most cases the inverse of the base needs to be calculated,
which is usually costs more than it saves.
Gary <gary@hotlava.com>
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:03