GCM is homework-grade

Open pqwy opened this issue 11 years ago • 1 comments

GF2^128
- Two boxed Int64s are bad.
- Multiplication is quadratic in polynomial size. Wield mean high-school techniques to make it faster.
- Might move GF treatment to C. It only requires two operations, and one is xor.
- Once there, might even use PCLMULQDQ for multiplication.
Counter should not collect block-by-block. Requires sane in-place xor not to.

Mar 15 '14 15:03 pqwy

Much progress on this front, but not integrated. Keeping open as a reminder. In the meantime, GCM is still not terribly fast.

Apr 10 '16 22:04 pqwy