The claimed Θ(Q log p / log Q) speedup is a restatement of known fixed-base precomputation tradeoffs, and the supplied experiments do not validate the stated memory and timing gains.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
M-ary Precomputation-Based Accelerated Scalar Multiplication Algorithms for Enhanced Elliptic Curve Cryptography
The claimed Θ(Q log p / log Q) speedup is a restatement of known fixed-base precomputation tradeoffs, and the supplied experiments do not validate the stated memory and timing gains.