mirror/gmsm
1
0
Fork 0
mirror of https://github.com/emmansun/gmsm.git synced 2025-05-10 19:16:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Updated SM4 with AESENCLAST (markdown)

Sun Yimin 2021-10-27 16:36:53 +08:00
parent 16b3f4d12b
commit a62e735b72
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
SM4-with-AESENCLAST.md

@ -13,7 +13,7 @@ A2(x) = M2*x + C2
The combinations of (M1, C1, M2, C2) or (A1, A2) are not unique.
Two known (M1, C1, M2, C2), please reference [sm4 with AESENCLAST](https://gist.github.com/emmansun/ae4677d71c75ff8407d5f5b3a884f5d2).
Known (M1, C1, M2, C2), please reference [sm4 with AESENCLAST](https://gist.github.com/emmansun/ae4677d71c75ff8407d5f5b3a884f5d2) and [AES 和 SM4 S盒複合域實現方法python code](https://gist.github.com/emmansun/9f8d449072f6048538add79bd146b661). In [AES 和 SM4 S盒複合域實現方法python code](https://gist.github.com/emmansun/9f8d449072f6048538add79bd146b661), we found 8 groups of (M1, C1, M2, C2).
My question is how to generate all (M1, C1, M2, C2)?