Kriston J. Rehberg (kriston@ibm.net)
Wed, 8 Apr 1998 11:33:36 -0400
Pardon the question, but does Elliptic Curve Cryptography avoid the
the use of large primes, or does it merely make them fantastically
large?
Thanks,
Kris
Perry E. Metzger writes:
>
>Adam Shostack writes:
>> | Autistics are still doing real computation, whether they can figure out
>> | the details or not. They're still restrained by the same complexity
>> | theoretic principles of tractability as computers are.
>>
>> Fascinating. I'm sure you have a reference to some clever experiment
>> that shows that autistics work that way?
>
>There have, in fact, been tests done. According to what I have read,
>people who are 'lightning calculators' take cleanly predictable
>periods to do various sized computations, and those times grow as the
>size of the problem in very non-magical ways. I don't have a reference
>handy, but several scholarly books have been written on "lightning
>calculator" phenomena.
>
>Perry
>
-- Kriston J. Rehberg ICQ: 3535970 http://kriston.net/ AOL: Kriston
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:55 ADT