|
[1]
|
Ullah, S., Zheng, J., Din, N., Hussain, M.T., Ullah, F. and Yousaf, M. (2023) Elliptic Curve Cryptography; Applications, Challenges, Recent Advances, and Future Trends: A Comprehensive Survey. Computer Science Review, 47, Article ID: 100530. [Google Scholar] [CrossRef]
|
|
[2]
|
胡晓辉, 巩俊辉, 徐宁, 等. 跨层优化的WSN能耗均衡拓扑博弈算法[J]. 计算机工程与应用, 2019, 55(14): 69-75.
|
|
[3]
|
杨晓秋. 高性能椭圆曲线标量乘算法的研究[D]: [硕士学位论文]. 哈尔滨: 哈尔滨理工大学, 2023.
|
|
[4]
|
兰修文. ECC计算算法的优化及其在SM2实现中的运用[D]: [硕士学位论文]. 成都: 电子科技大学, 2019.
|
|
[5]
|
黄世中, 羊红光. NAF编码方法的分析与应用[J]. 信息网络安全, 2012(5): 4-6+35.
|
|
[6]
|
赵石磊, 杨晓秋, 刘志伟. 一种低复杂度的改进wNAF标量乘算法[J]. 电子学报, 2022, 50(4): 977-983.
|
|
[7]
|
Hai, H., Ning, N., Lin, X., Zhiwei, L., Bin, Y. and Shilei, Z. (2021) An Improved wNAF Scalar-Multiplication Algorithm with Low Computational Complexity by Using Prime Precomputation. IEEE Access, 9, 31546-31552. [Google Scholar] [CrossRef]
|
|
[8]
|
国家密码管理局. GB/T 32918.1-2016.SM2椭圆曲线公钥密码算法 第1部分: 总则[S]. 北京: 中国标准出版社, 2016.
|
|
[9]
|
Cohen, H., Miyaji, A. and Ono, T. (1998) Efficient Elliptic Curve Exponentiation Using Mixed Coordinates. In: Ohta, K. and Pei, D.Y., Eds., Advances in Cryptology—ASIACRYPT’98, Springer, 51-65. [Google Scholar] [CrossRef]
|
|
[10]
|
Okeya, K. and Sakurai, K. (2001) Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the Y-Coordinate on a Montgomery-Form Elliptic Curve. In: Proceedings of the 4th International Workshop on Cryptographic Hardware and Embedded Systems, Springer, 126-141. [Google Scholar] [CrossRef]
|
|
[11]
|
于伟, 李宝, 王鲲鹏, 等. 特3有限域上椭圆曲线的co-Z Montgomery算法[J]. 计算机学报, 2017, 40(5): 1121-1133.
|
|
[12]
|
刘双根, 王蓉蓉, 李圣雨. GF(3m)上Hessian曲线的三进制Montgomery算法[J]. 山东大学学报(理学版), 2019, 54(1): 96-102.
|
|
[13]
|
谭光昭, 周骅. 面向物联网安全的素域SM2倍点硬件优化[J]. 运筹与模糊学, 2023, 13(6): 7247-7255.
|
|
[14]
|
Longa, P. and Sica, F. (2012) Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication. In: Advances in Cryptology—ASIACRYPT 2011, Springer, 718-739. [Google Scholar] [CrossRef]
|
|
[15]
|
王学理, 斐定一. 椭圆与超椭圆曲线公钥密码的理论与实现[M]. 北京: 科学出版社, 2006: 462-463.
|
|
[16]
|
Solinas, J.A. (2000) Efficient Arithmetic on Koblitz Curves. Designs, Codes and Cryptography, 19, 195-249. [Google Scholar] [CrossRef]
|
|
[17]
|
Cui, Y., Liu, Q., Yao, Y., Xu, X., Wu, W. and Xu, X. (2023) An Area-Efficient and Low-Latency Elliptic Curve Scalar Multiplication Accelerator over Prime Field. Microprocessors and Microsystems, 103, Article ID: 104944. [Google Scholar] [CrossRef]
|
|
[18]
|
Joye, M. and Yen, S.M. (2000) Optimal Left-to-Right Binary Signed-Digit Recoding. IEEE Transactions on Computers, 49, 740-748. [Google Scholar] [CrossRef]
|
|
[19]
|
Li, M., Li, N., Liu, H., Cheng, S., Hu, X. and Li, J. (2023). Implementation of a Safe and Efficient Point Multiplication for SM2 Algorithm. 2023 IEEE 6th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC), Chongqing, 24-26 February 2023, 137-141.[CrossRef]
|
|
[20]
|
Alkim, E., Ducas, L., Pöppelmann, T., et al. (2016) Post-Quantum Key {Exchange-A} New Hope. 25th USENIX Security Symposium (USENIX Security 16), Austin, 10-12 August 2016, 327-343.
|