scientific article; zbMATH DE number 1689040

MaRDI QIDQ2762785zbMATH OpenFDO

Authors Huapeng Wu

Publication date 9 January 2002

zbMATH Keywords

complexityelliptic curve cryptographyfinite fieldssquaring operationtrinomial-based polynomial basis

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1504817
• Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
• scientific article; zbMATH DE number 1759299
• Fast algorithm of square rooting in some finite fields of odd characteristic
• On bit-serial multiplication and dual bases in GF(2/sup m/)

Cited in

(1)

• Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762785)