Improved Scalar Multiplication Based on ωNAFRepresentation of Feature Sequences Under Sliding Window Algorithm

Elliptic Curve Cryptography (ECC) is extensively utilized in various security applications due to its high efficiency and security. The core operation in ECC, elliptic curve scalar multiplication, significantly impacts the performance of the entire cryptographic system. To reduce the computational complexity of scalar multiplication, this paper proposes an improved algorithm that combines the sliding window method with the ωNAF (N on-Adjacent Form) algorithm, enhancing performance by representing ones feature sequences using the ωNAF algorithm. Theoretical analysis and experimental simulations demonstrate that this algorithm achieves lower complexity compared to the conventional sliding window algorithm with small windows.