Abstract:The SECP256K1 elliptic curve algorithm is fundamental in cryptocurrency wallets for generating secure public keys from private keys, thereby ensuring the protection and ownership of blockchain-based digital assets. However, the literature highlights several successful side-channel attacks on hardware wallets that exploit SECP256K1 to extract private keys. This work proposes a novel hardware architecture for SECP256K1, optimized for side-channel attack resistance and efficient resource utilization. The architecture incorporates complete addition formulas, temporary registers, and parallel processing techniques, making elliptic curve point addition and doubling operations indistinguishable. Implementation results demonstrate an average reduction of 45% in LUT usage compared to similar works, emphasizing the design's resource efficiency.
Abstract:Polar codes can be decoded with the low-complexity successive-cancellation flip (SCF) algorithm. To improve error-correction performance, the dynamic successive-cancellation flip (DSCF) variant was proposed, where the resulting error-correction performance is similar to that of the successive-cancellation list algorithm with low to moderate list sizes. Regardless of the variant, the SCF algorithm exhibits a variable execution time with a high (worst-case) latency. In this work, we propose an early-stopping metric used to detect codewords that are likely undecodable such that the decoder can be stopped at earlier stages for those codewords. We then propose a modified version of the DSCF algorithm that integrates our early-stopping metric that exploits the specific properties of DSCF. Compared to the original DSCF algorithm, in the region of interest for wireless communications, simulation results show that our proposed modifications can lead to reductions of 22% to the average execution time and of 45% to the execution-time variance at the cost of a minor error-correction loss of approximately 0.05 dB.