mirror/gmsm
1
0
Fork 0
mirror of https://github.com/emmansun/gmsm.git synced 2025-05-11 03:26:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

Updated SM9实现及优化 (markdown)

Sun Yimin 2023-07-12 11:43:58 +08:00
parent 6e2c5b3f0a
commit e1b74f65d3
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
SM9实现及优化.md

@ -77,7 +77,7 @@ BenchmarkGfP2SquareU-6 17728008 66.35 ns/op 0 B/op 0 al
## 下一步
SM9算法好像比较冷门、应用也没有SM2广泛，因为[128位安全性挑战](https://moderncrypto.org/mail-archive/curves/2016/000740.html)？还是因为实现复杂度和性能？
* 参考《New software speed records for cryptographic pairings》使用浮点运算和SIMD实现？
* [High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves](https://eprint.iacr.org/2010/354.pdf)，平方扩域上的运算优化，不过由于他的p选择，有其特殊性。
* [High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves](https://eprint.iacr.org/2010/354.pdf)，平方扩域上的运算优化，不过由于他的p选择，有其特殊性，基本无参考价值。
* 小步的优化：
+ gfP2 乘法、平方等的asm实现；
+ curvePoint/G1 曲线运算add/dobule的进一步优化；