This talk will describe some recent advances in software speed for various computations in fields of characteristic 2. This talk will explain, for example, why the latest speed records for elliptic-curve cryptography use fields of characteristic 2, and why normal bases are being used instead of polynomial bases in software to attack the "infeasible" ECC2K-130 challenge.