From d54d300fdf91b8db1ff5cdde61375f82c696d46b Mon Sep 17 00:00:00 2001
From: Sun Yimin <emmansun@users.noreply.github.com>
Date: Thu, 9 Oct 2025 10:59:20 +0800
Subject: [PATCH] =?UTF-8?q?Updated=20sm2=5Fz256=5Floong64.S=20=E4=BB=A3?=
 =?UTF-8?q?=E7=A0=81=E5=88=86=E6=9E=90=20(markdown)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 sm2_z256_loong64.S-代码分析.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/sm2_z256_loong64.S-代码分析.md b/sm2_z256_loong64.S-代码分析.md
index bf7fd29..e1d3a78 100644
--- a/sm2_z256_loong64.S-代码分析.md
+++ b/sm2_z256_loong64.S-代码分析.md
@@ -78,5 +78,6 @@ $T_3=T + T_2=(t_4+t_0-t_0>>32) \ast 2^{256}+(t_3 - t_0<<32) \ast 2^{192} + (t_2
 1. 约简还没完成，也就是上一步 $T_2 + T$ 还没算完，就开始了下一个字的乘法，代码可读性降低，为了性能？
 1. 最后，依然使用加`1`来实现`mod P`，这里的`1`为  $2^{256} - P$ 。
 
-
+## __sm2_z256_modp_mont_sqr
+计算 `(t0, t1, t2, t3) = (t0, t1, t2, t3)^2`。