2022-03-11 22:41:38 +0200 received badge ● Popular Question (source) 2022-01-19 12:38:24 +0200 received badge ● Popular Question (source) 2021-07-14 09:47:05 +0200 received badge ● Taxonomist 2019-04-30 17:47:01 +0200 received badge ● Scholar (source) 2019-04-30 17:46:59 +0200 received badge ● Supporter (source) 2019-04-30 16:00:05 +0200 received badge ● Student (source) 2019-04-29 19:11:01 +0200 asked a question What does the 'a' and x^254 in code means? sage: R.=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  2019-04-29 19:11:01 +0200 asked a question What can i do about this large boolean function? 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.