Hi, I'm a student in my final year of civil engineering and doing a thesis concerning Sage and cryptography. As a part of my thesis I would like to extend Sage and it's capabilities concerning boolean functions. Right now I'm looking into making some representations available (truth table, ANF, Walsh Transform, Trace representation ...) and the properties which can be derived from those representations (correlation immunity, linearity, ...). Conversion between the different representations should also be possible. Basicly, I'm thinking about providing different objects for the different representations (if I'm not mistaken, the BooleanPolynomial in Sage looks like ANF representation) and accompanying methods for getting the properties and providing a conversion interface.
I'm still planning on how to do it exactly but I was wondering if there have been discussions about this in the past or if someone else is working on or interested in the same subject. Christophe --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com 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://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
