High-speed cryptography in characteristic 2

Introduction
Tools:
Linear maps
Polynomial multiplication:
Bit operations
Field multiplication:
Type-II bases
Elliptic curves:
Binary Edwards
Challenges
Error-correcting codes:
McBits

Optimizing linear maps mod 2

[linearmod2] 16pp. (PDF) D. J. Bernstein. Optimizing linear maps modulo 2. Document ID: e5c3095f5c423e2fe19fa072e23bd5d7. URL: http://cr.yp.to/papers.html#linearmod2. Date: 2009.10.05. Supersedes: (PDF) 2009.08.30.

sort1.cpp is a straightforward implementation of the paper's algorithm. See the paper for a usage example.

Version

This is version 2009.10.06 of the linearmod2.html web page.