| 成员 | 学号 | Github账号 |
|---|---|---|
| 翁梓诚 | 202000460122 | Lubenwei-nb123 |
| 任务 | 是否完成 |
|---|---|
| implement the naïve birthday attack of reduced SM3 | ✔ |
| implement the Rho method of reduced SM3 | ✔ |
| implement length extension attack for SM3, SHA256, etc. | ✔ |
| do your best to optimize SM3 implementation (software) | ✔ |
| Impl Merkle Tree following RFC6962 | ✔ |
| Try to Implement this scheme | |
| report on the application of this deduce technique in Ethereum with ECDSA | ✔ |
| Impl Merkle Tree following RFC6962 | ✔ |
| impl sm2 with RFC6979 | |
| verify the above pitfalls with proof-of-concept code | ✔ |
| Implement the above ECMH scheme | ✔ |
| Implement a PGP scheme with SM2 | |
| implement sm2 2P sign with real network communication | ✔ |
| PoC impl of the scheme, or do implement analysis by Google | ✔ |
| implement sm2 2P decrypt with real network communication | ✔ |
| send a tx on Bitcoin testnet, and parse the tx data down to every bit, better write script yourself | |
| forge a signature to pretend that you are Satoshi | ✔ |
| research report on MP | ✔ |
| Find a key with hash value “sdu_cst_20220610” under a message composed of your name followed by your student ID. For example, “San Zhan 202000460001” | |
| Find a 64-byte message under some k fulfilling that their hash value is symmetrical | |
| Real world zk |
下载SM3_advanced后，打开SM3_advanced.cpp直接运行即可
最终找到了16bits的碰撞.
下载SM3_advanced后，打开SM3_advanced.cpp直接运行即可
最终找到了256bits的碰撞.
初始明文为$M = M_1||M_2||M_3||M_4||M_5||M_6 = 0x01||0x02||0x03||0x04||0x05||0x06$
迭代函数为$M_1||M_2||M_3||M4||M_5||M_6 \leftarrow M_1+2||M_2+2||M_3+2||M_4+2||M_5+2||M_6+2$
分别进行前8、16、128、256bits的碰撞，运行结果如下：
下载SM3_advanced后，打开SM3_advanced.cpp直接运行即可
2022.7.14
以字符串"SDU"为样例，输出如下：
下载SM3_advanced后，打开SM3_advanced.cpp直接运行即可
2022.7.7
- 使用循环展开，让循环CPE逼近吞吐量界限。
- 使用inline关键字替代宏定义，使得算法鲁棒性更强.(详见Effective C++)
- 尽可能使用三目运算符代替if{}else{}，即使用数据传送来代替条件转移，提升效率.(详见CSAPP)
以下是运行截图
打开Merkle_Tree.go后直接运行即可
基于Go语言的Merkle树实现，其中附带了一个样例：
输出结果如下：
将deduce.py和func_lib.py放在同一文件夹下后运行deduce.py即可
明文以字符串"SDU"为样例，输出如下：
下载pitfalls后，直接运行pitfalls.py即可.
按照课件上的方法进行攻击即可，运行结果如下：
参考链接：(14条消息) SM3算法 (python)_Love is Zero的博客-CSDN博客_sm3python
下载ECMH后，直接运行ECMH.py即可
多集合哈希有以下优点：
- 非常高效
- 快速验证比特币所有权
运行结果如下：
参考链接：[bitcoin-dev] Rolling UTXO set hashes (linuxfoundation.org)
下载2 parties sign后，先运行P2.py再运行P1.py即可.
按照PPT上的方法编写代码，运行截图如下
下载PoC后，先运行server.py，再运行client.py即可.
根据PPT上编写代码即可，运行截图如下
下载2 parties dec后，先运行P2.py，再运行P1.py即可.
根据课件编写代码即可，运行截图如下
参考链接：https://blog.csdn.net/HORHEART/article/details/120123657
*Project: send a tx on Bitcoin testnet, and parse the tx data down to every bit, better write script yourself
下载forge Satoshi's signature后直接运行forge sign.py即可
通过Google搜索，在https://cryptome.org/2015/11/satoshi-nakamoto-public-key.htm 上找到了中本聪的公钥：
-----BEGIN PGP PUBLIC KEY BLOCK-----
Version: GnuPG v1.4.7 (MingW32)
mQGiBEkJ+qcRBADKDTcZlYDRtP1Q7/ShuzBJzUh9hoVVowogf2W07U6G9BqKW24r
piOxYmErjMFfvNtozNk+33cd/sq3gi05O1IMmZzg2rbF4ne5t3iplXnNuzNh+j+6
VxxA16GPhBRprvnng8r9GYALLUpo9Xk17KE429YYKFgVvtTPtEGUlpO1EwCg7FmW
dBbRp4mn5GfxQNT1hzp9WgkD/3pZ0cB5m4enzfylOHXmRfJKBMF02ZDnsY1GqeHv
/LjkhCusTp2qz4thLycYOFKGmAddpVnMsE/TYZLgpsxjrJsrEPNSdoXk3IgEStow
mXjTfr9xNOrB20Qk0ZOO1mipOWMgse4PmIu02X24OapWtyhdHsX3oBLcwDdke8aE
gAh8A/sHlK7fL1Bi8rFzx6hb+2yIlD/fazMBVZUe0r2uo7ldqEz5+GeEiBFignd5
HHhqjJw8rUJkfeZBoTKYlDKo7XDrTRxfyzNuZZPxBLTj+keY8WgYhQ5MWsSC2MX7
FZHaJddYa0pzUmFZmQh0ydulVUQnLKzRSunsjGOnmxiWBZwb6bQjU2F0b3NoaSBO
YWthbW90byA8c2F0b3NoaW5AZ214LmNvbT6IYAQTEQIAIAUCSQn6pwIbAwYLCQgH
AwIEFQIIAwQWAgMBAh4BAheAAAoJEBjAnoZeyUihXGMAnjiWJ0fvmSgSM3o6Tu3q
RME9GN7QAKCGrFw9SUD0e9/YDcqhX1aPMrYue7kCDQRJCfqnEAgA9OTCjLa6Sj7t
dZcQxNufsDSCSB+yznIGzFGXXpJk7GgKmX3H9Zl4E6zJTQGXL2GAV4klkSfNtvgs
SGJKqCnebuZVwutyq1vXRNVFPQFvLVVo2jJCBHWjb03fmXmavIUtRCHoc8xgVJMQ
LrwvS943GgsqSbdoKZWdTnfnEq+UaGo+Qfv66NpT3Yl0CXUiNBITZOJcJdjHDTBO
XRqomX2WSguv+btYdhQGGQiaEx73XMftXNCxbOpqwsODQns7xTcl2ENru9BNIQME
I7L9FYBQUiKHm1k6RrBy1as8XElS2jEos7GAmlfF1wShFUX+NF1VOPdbN3ZdFoWq
sUjKk+QbrwADBQgA9DiD4+uuRhwk2B1TmtrXnwwhcdkE7ZbLHjxBfCsLPAZiPh8c
ICfV3S418i4H1YCz2ItcnC8KAPoS6mipyS28AU1B7zJYPODBn8E7aPSPzHJfudMK
MqiCHljVJrE23xsKTC0sIhhSKcr2G+6ARoG5lwuoqJqEyDrblVQQFpVxBNPHSTqu
O5PoLXQc7PKgC5SyQuZbEALEkItl2SL2yBRRGOlVJLnvZ6eaovkAlgsbGdlieOr0
UwWuJCwzZuBDruMYAfyQBvYfXZun3Zm84rW7Jclp18mXITwGCVHg/P5n7QMbBfZQ
A25ymkuj636Nqh+c4zRnSINfyrDcID7AcqEb6IhJBBgRAgAJBQJJCfqnAhsMAAoJ
EBjAnoZeyUihPrcAniVWl5M44RuGctJe+IMNX4eVkC08AJ9v7cXsp5uDdQNo8q3R
8RHwN4Gk8w==
=3FTe
-----END PGP PUBLIC KEY BLOCK-----
但是由于我不太清楚如何处理PGP格式的公钥，故无法在我的代码上真正的伪造中本聪的信息，只能写出对应伪造过程的代码，并验证其正确性.
打开Research report on MP中的README即可.
略
Project: Find a key with hash value “sdu_cst_20220610” under a message composed of your name followed by your student ID. For example, “San Zhan 202000460001”.
- Write a circuit to prove that your CET6 grade is larger than 425
a. Your grade info is like (cn_id, grade, year, sig_by_moe)，These grades are published as commitments onchain by MoE.
b. When you got an interview from an employer, you can prove to them that you have passed the exam without letting them know the exact grade. - The commitment scheme used by MoE is SHA256-based.
a. commit = SHA256(cn_id, grade, year, sig_by_moe, r)