<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>2019de1ctf on 蛇索尼 Aiden</title><link>https://blog.haitai-social.com/note/%E5%B7%A5%E5%85%B7%E4%BD%BF%E7%94%A8%E6%8E%A5%E5%8F%A3/ctf-writeup/2019de1ctf/</link><description>Recent content in 2019de1ctf on 蛇索尼 Aiden</description><generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>shesl-meow@qq.com (佘崧林)</managingEditor><webMaster>shesl-meow@qq.com (佘崧林)</webMaster><lastBuildDate>Tue, 06 Aug 2019 22:13:24 +0800</lastBuildDate><atom:link href="https://blog.haitai-social.com/note/%E5%B7%A5%E5%85%B7%E4%BD%BF%E7%94%A8%E6%8E%A5%E5%8F%A3/ctf-writeup/2019de1ctf/index.xml" rel="self" type="application/rss+xml"/><item><title>baby rsa</title><link>https://blog.haitai-social.com/note/%E5%B7%A5%E5%85%B7%E4%BD%BF%E7%94%A8%E6%8E%A5%E5%8F%A3/ctf-writeup/2019de1ctf/babyrsa/</link><pubDate>Tue, 06 Aug 2019 22:13:24 +0800</pubDate><author>shesl-meow@qq.com (佘崧林)</author><guid>https://blog.haitai-social.com/note/%E5%B7%A5%E5%85%B7%E4%BD%BF%E7%94%A8%E6%8E%A5%E5%8F%A3/ctf-writeup/2019de1ctf/babyrsa/</guid><description>这题涉及了大量的 RSA 相关的破解知识。 题目 阅读题目之后实际上就是解数个方程，在没有 hint 的情况下，方程如下： $$\begin{cases} p^4 \equiv C_{1} \pmod{N_{1}} \ p^4 \equiv C_{2} \pmod{N_{2}} \ p^4 \equiv C_{3} \pmod{N_{3}} \ p^4 \equiv C_{4} \pmod{N_{4}}\end{cases}$$</description></item><item><title>baby lfsr</title><link>https://blog.haitai-social.com/note/%E5%B7%A5%E5%85%B7%E4%BD%BF%E7%94%A8%E6%8E%A5%E5%8F%A3/ctf-writeup/2019de1ctf/babylfsr/</link><pubDate>Tue, 30 Jul 2019 11:01:03 +0800</pubDate><author>shesl-meow@qq.com (佘崧林)</author><guid>https://blog.haitai-social.com/note/%E5%B7%A5%E5%85%B7%E4%BD%BF%E7%94%A8%E6%8E%A5%E5%8F%A3/ctf-writeup/2019de1ctf/babylfsr/</guid><description>在比赛的时候一直在想怎么用 berlekamp_massey 算法求解（用矩阵求解，写代码更快，512 比特没必要用 BM 算法），并且把判断条件抄成了 1124 &amp;hellip;. 脚本 破解 LFSR：指定一个</description></item></channel></rss>