> > * I'd be very happy if you'd share your code! I would like to make sure > > that it fits into the current framework/is compatible and reuses the > > existing machinery. Are you doing that? > > I don't think so. What should I do to make my code to fit in the SAGE > framework? Maybe there are some guidelines for developers? The only > link i found was this one http://www.sagemath.org/development.html
Hi there, at http://sage.math.washington.edu/home/mhansen/doc-sphinx/SageDevelopersGuide.pdf you'll find a prerelease of the new developer's guide. Some parts are not finished/polished but it should answer at least some questions. My main point however is that the implementation of this functionality should be in crypto/mq/sr.py (i.e. in the classes for SR) and re-use the methods provided there (for consistency). Let me know if you need help. > > * If we're going to support direct representation of ciphertext bits in > > plaintext and key variables we should also support GF(2^n) as base field > > not only GF(2), i.e. BES style equations. This will be slightly more > > involving. > > Anyway I was already thinking of developing a version of my code for > GF(2^n), so I would gladly help with this. Excellent! Cheers, Martin -- 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-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
