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 variants would be really, really cool.
Also, as the hash competition is coming up implementing many currently discussed 'provable secure' hash functions could be a good idea. Anyway, +1 for attempting to improve SAGE with respect to crypto. Martin PS: I am working on some block cipher implementations too, but mainly to generate polynomial systems for them. But these should be integrated with the general crypto package stuff, I guess. -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _www: http://www.informatik.uni-bremen.de/~malb _jab: [EMAIL PROTECTED] --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
