Recent papers show that the existence of numerous linearly independent (LI) transformations in GF(2) algebra creates circuits that are superior in the design of XOR based polynomial expansions and corresponding digital circuits. In this paper, new classes of LI logic transformations and their corresponding polynomial expansions over GF(2) are identified and introduced. The transforms are the fastest and most efficient LI transformation in terms of its GF(2) computational complexity.