On 5/28/07, Andrew Budker <[EMAIL PROTECTED]> wrote:
>
> My name is Andrew Budker and I'm a fourth year undergraduate
> Mathematics of Computation student at UCLA. This quarter (and over the
> summer) I'll be taking an independent studies course with Nathan Ryan,
> and hope to be able to contribut
One thing that -- I think -- is missing from most of those crypto
implementations is the ability to scale down below secure thresholds, i.e.,
to use toy cipher variants. As we are not interested in productivity crypto
but in research that would be very valuable. So reduced round/blocksize
vari
"William Stein" <[EMAIL PROTECTED]> writes:
> SUMMARY: There is a huge amount of crypto-related functionality in
> SAGE already, but it is "all over", and there are some exciting and unique
> cryptographic algorithms that could be implemented in SAGE that
> aren't implemented now.
In addition, S
On May 28, 2007, at 7:38 PM, Nick Alexander wrote:
>
> "William Stein" <[EMAIL PROTECTED]> writes:
>
>> SUMMARY: There is a huge amount of crypto-related functionality in
>> SAGE already, but it is "all over", and there are some exciting
>> and unique
>> cryptographic algorithms that could be
Hi Everyone,
The main crypto functionality that I implemented concerns classical
cryptography,
for the purposes of teaching:
http://echidna.maths.usyd.edu.au/~kohel/tch/Crypto/
Hence most of the systems are breakable (using suitable classical
cryptanalytic
attacks). The cryptosystem class can
Hello everyone,
I guess I should have been a little more specific about exactly what
i'm trying to do.
As a crypto student, I would have found it useful to see not only to
see reduced round versions of some of the more of the advanced crypto
systems, but virtually every real implementation avo
