<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hjjsn的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hjjsn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hjjsn]]></copyright><item><title><![CDATA[buu_Crypto(31-)]]></title><link>https://blog.youkuaiyun.com/hjjsn/article/details/147116261</link><guid>https://blog.youkuaiyun.com/hjjsn/article/details/147116261</guid><author>hjjsn</author><pubDate>Thu, 17 Apr 2025 13:42:15 +0800</pubDate><description><![CDATA[得到这一串我又虎躯一震，已知RSA中的C = M^e mod n ，e不再是65537而是一位数----3？打开附件是两个txt文件，没见过的东西，还是在网上看了别人的解题过程，才知道[  ]里面两个前面的是n，后面的是e，虽然还不知道为什么，下面的就是加密后的flag，但是要用逗号拼接一下。我们把两个文件的后缀改成txt格式，打开得到一个公钥（.key文件也可以直接用010打开），一串乱码（意料之中），那么我们下一步就解析这段公钥。#后的东西可能是运行结果，要我们反向求flag。print c 差个()]]></description><category></category></item><item><title><![CDATA[buu_Crypto(27-30)]]></title><link>https://blog.youkuaiyun.com/hjjsn/article/details/147024758</link><guid>https://blog.youkuaiyun.com/hjjsn/article/details/147024758</guid><author>hjjsn</author><pubDate>Tue, 08 Apr 2025 17:31:22 +0800</pubDate><description><![CDATA[bnalkdshgjl/fkldhgnliasrkfjdgnhjksJFDN'Lsdk]]></description><category></category></item><item><title><![CDATA[buu_Crypto(22-26)]]></title><link>https://blog.youkuaiyun.com/hjjsn/article/details/146973869</link><guid>https://blog.youkuaiyun.com/hjjsn/article/details/146973869</guid><author>hjjsn</author><pubDate>Sat, 05 Apr 2025 09:30:39 +0800</pubDate><description><![CDATA[欸嘿]]></description><category></category></item><item><title><![CDATA[buu-Crypto（17-21）]]></title><link>https://blog.youkuaiyun.com/hjjsn/article/details/146763584</link><guid>https://blog.youkuaiyun.com/hjjsn/article/details/146763584</guid><author>hjjsn</author><pubDate>Wed, 02 Apr 2025 18:03:08 +0800</pubDate><description><![CDATA[没有摘要]]></description><category></category></item><item><title><![CDATA[buu_Crypto 解题（13-16）]]></title><link>https://blog.youkuaiyun.com/hjjsn/article/details/146592092</link><guid>https://blog.youkuaiyun.com/hjjsn/article/details/146592092</guid><author>hjjsn</author><pubDate>Sun, 30 Mar 2025 09:37:12 +0800</pubDate><description><![CDATA[注意第二条，给了一个非常关键的线索——“加密成NTLM Hash”，hash加密，再加上文件中有ctf:样式的标注，把ctf后的东西解密一下。点开题目，提到了一种，要我们去找下文提到的加密向量，用这个向量去加密附件密文，题目线索：罗马三巨头之一，公元一百年前。num = int(input("请输入一个大于1的正整数: "))所以向量是13，再去把附件的密文加密，得到PbzrPuvan，打包抬走，下一题。print(f"{num} 是质数，无法继续分解")"""返回正整数n的质因数列表"""]]></description><category></category></item><item><title><![CDATA[MIsc_Crypto解题]]></title><link>https://blog.youkuaiyun.com/hjjsn/article/details/146556962</link><guid>https://blog.youkuaiyun.com/hjjsn/article/details/146556962</guid><author>hjjsn</author><pubDate>Thu, 27 Mar 2025 20:34:29 +0800</pubDate><description><![CDATA[buu ctf crypto题目1-12]]></description><category></category></item></channel></rss>