scientific article

zbMATH Open0992.94514MaRDI QIDQ2762785

Huapeng Wu

Publication date: 9 January 2002

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexityfinite fieldselliptic curve cryptographysquaring operationtrinomial-based polynomial basis

Mathematics Subject Classification ID

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

Related Items (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)