Cryptology ePrint Archive: Report 2012/414

Available versions in chronological order

20120801:035849 (posted 01-Aug-2012 03:58:49 UTC): Low complexity bit-parallel $GF(2^m)$ multiplier for all-one polynomials; Yin Li and Gong-liang Chen and Xiao-ning Xie

[ Cryptology ePrint archive ]