athulan's profile - activity

sage: R.<x>=GF(2^8,'a')[]
sage: from sage.crypto.boolean_function import BooleanFunction
sage: B = BooleanFunction( x^254 ) # the Boolean function Tr(x^254)
sage: B

If i have a large boolean function like this:

FUN() = (
    (( ~g&(f^i^0))|(g&(1^f^h^0)))^(( ~x&(w^z^0))|(x&(1^w^y^0)))
    ^((d&(1^a^b^e))|( ~d&(1^a^c^e)))^((m&(1^j^k^n))|( ~m&(1^j^l^n)))
    ^o^p^q^0^r^s^t^u^v
    )

can anyone explain how can i code to obtain the non-linearity of this boolean formula?

I didn't really understand the BooleanFunction() function in Sage.