Efficient multiplication in GF (p/sup k/) for elliptic curve cryptography

JC Bajard - Proceedings 2003 16th IEEE Symposium on …, 2003 - ieeexplore.ieee.org
We present a new multiplication algorithm for the implementation of elliptic curve
cryptography (ECC) over the finite extension fields GF (p/sup k/) where p is a prime number …
被引用次数：43 相关文章

Efficient multiplication in GF (p/sup k/) for elliptic curve cryptography

JC Bajard, L Imbert, C Negre… - Proceedings. 16th IEEE …, 2003 - computer.org
We present a new multiplication algorithm for the implementation of elliptic curve
cryptography (ECC) over the finite extension fields GF (p/sup k/) where p is a prime number …

Efficient Multiplication in GF (pk) for Elliptic Curve Cryptography

JC Bajard, L Imbert, C Nègre, T Plantard - Proceedings of the 16th IEEE …, 2003 - dl.acm.org
We present a new multiplication algorithm for the implementation of elliptic curve
cryptography (ECC) over the finite extension fields GF (pk) where p is a prime number …

[引用][C] Efficient Multiplication in GF (p^ k) for Elliptic Curve Cryptography

JC Bajard, L Imbert, C Negre, T Plantard - ARITH-16'03: IEEE …, 2003 - hal.science
Efficient Multiplication in GF (p^k) for Elliptic Curve Cryptography - Archive ouverte HAL Accéder
directement au contenu Documentation FR Français (FR) Anglais (EN) Se connecter HAL …

Efficient Multiplication in GF (pk) for Elliptic Curve Cryptography

JC Bajard, L Imbert, T Plantard - Proceedings. 16th IEEE …, 2003 - computer.org
We present a new multiplication algorithm for the implementation of elliptic curve
cryptography (ECC) over the finite extension fields GF (pk) where p is a prime number …