Conversions between different boolean function representations:

There are many representations for a boolean function. The advantage of each representation depends on the application that is using the boolean function. In this website, we deal with three representations: the truth table, the algebraic normal form and the trace representation. In fact the truth table representation is the default representation of boolean functions since it can be constructed from the definition of the boolean function. The algebraic normal form is the usually most used representation in cryptography and coding while the trace representation  is used in sequence theory. In this page we convert between the three different representations. For more information about how to enter your boolean function and how the conversions work, click on the links below:
Convert between representations
Enter the primitive polynomial From Truth Table From Trace From ANF Number of variables: 2 Number of variables: 3 Number of variables: 4 Number of variables: 5 Number of variables: 6 Number of variables: 7 Number of variables: 8 Number of variables: 9 Number of variables: 10 Number of variables: 11 Number of variables: 12 Number of variables: 13 Number of variables: 14 Number of variables: 15 Number of variables: 16 Number of variables: 17 Number of variables: 18 Number of variables: 19 Number of variables: 20 Number of variables: 21

Enter the primitive polynomial To Truth Table To Trace To ANF