> 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)
Hi, yes, it is ANF. > and accompanying methods for > getting the properties and providing a conversion interface. Very nice. > 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. Someone in my department (Information Security Group at Royal Holloway, University of London) expressed interest in this recently. I forwarded your e-mail. Improvements to BooleanPolynomial could be sent to the PolyBoRi authors (PolyBoRi is the underlying implementation) to check whether they want to incorporate them upstream. 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 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 -~----------~----~----~----~------~----~------~--~---
