Cryptology ePrint Archive: Report 2004/279
Available versions in chronological order
20041030:155504 (posted 30-Oct-2004 15:55:04 UTC)
Parallel Montgomery Multiplication in $GF(2^k)$ using Trinomial Residue Arithmetic
Jean-Claude Bajard and Laurent Imbert and Thomas Plantard
Publication Info: Submitted to ARITH17, the 17th IEEE symposium on computer arithmetic
20041113:074305 (posted 13-Nov-2004 07:43:05 UTC)
Parallel Montgomery Multiplication in $GF(2^k)$ using Trinomial Residue Arithmetic
Jean-Claude Bajard and Laurent Imbert and Graham A. Jullien
Publication Info: Submitted to ARITH17, the 17th IEEE symposium on computer arithmetic
20041113:074846 (posted 13-Nov-2004 07:48:46 UTC)
Parallel Montgomery Multiplication in $GF(2^k)$ using Trinomial Residue Arithmetic
Jean-Claude Bajard and Laurent Imbert and Graham A. Jullien
Publication Info: Submitted to ARITH17, the 17th IEEE symposium on computer arithmetic
20041113:074949 (posted 13-Nov-2004 07:49:49 UTC)
Parallel Montgomery Multiplication in $GF(2^k)$ using Trinomial Residue Arithmetic
Jean-Claude Bajard and Laurent Imbert and Graham A. Jullien
Publication Info: Submitted to ARITH17, the 17th IEEE symposium on computer arithmetic
20050310:223709 (posted 10-Mar-2005 22:37:09 UTC)
Parallel Montgomery Multiplication in $GF(2^k)$ using Trinomial Residue Arithmetic
Jean-Claude Bajard and Laurent Imbert and Graham A. Jullien
Publication Info: Submitted to ARITH17, the 17th IEEE symposium on computer arithmetic
[
Cryptology ePrint archive
]