[JoGu]

Cryptology

Algebraic Normal Form of a BOOLEan Map

a7Hzq .#5r<
kÜ\as TâÆK$
ûj(Ö2 ñw%h:
Úk{4R f~`z8
¤˜Æ+Ô „&¢Dø

Input the truth table of your map into the input field. Each line is for one component. (For an example see below.)

Truth
table:


Example: Correspondence of indices in bit vectors and Monomials in the indeterminates (T1, ..., Tn):

0 <--> 00 <--> 1,
1 <--> 01 <--> T2,
2 <--> 10 <--> T1,
3 <--> 11 <--> T1T2.
Therefore the bit vector u = 0101 has components u00 = 0, u01 = 1, u10 = 0, u11 = 1, and the pair of bit vectors
   0101
   1011
is the representation of the map f: F22 ---> F22 whose first component f1 has values
f1(00) = 0, f1(01) = 1, f1(10) = 0, f1(11) = 1
and whose second component has values
f2(00) = 1, f2(01) = 0, f2(10) = 1, f2(11) = 1.


Klaus Pommerening, 28. November 2002; last change: 3 December 2002.