From e1b74f65d39034c015d21ae74b68f63077bc9a49 Mon Sep 17 00:00:00 2001 From: Sun Yimin Date: Wed, 12 Jul 2023 11:43:58 +0800 Subject: [PATCH] =?UTF-8?q?Updated=20SM9=E5=AE=9E=E7=8E=B0=E5=8F=8A?= =?UTF-8?q?=E4=BC=98=E5=8C=96=20(markdown)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- SM9实现及优化.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/SM9实现及优化.md b/SM9实现及优化.md index b9bda84..8b42b79 100644 --- a/SM9实现及优化.md +++ b/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的进一步优化；