Cryptology ePrint Archive: Report 2015/498
Available versions in chronological order
20150526:141330 (posted 26-May-2015 14:13:30 UTC)
Low Space Complexity CRT-based Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
Jiajun Zhang and Haining Fan
20150605:031609 (posted 05-Jun-2015 03:16:09 UTC)
Low Space Complexity CRT-based Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
Jiajun Zhang and Haining Fan
[
Cryptology ePrint archive
]