<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>RSA on</title><link>/tags/rsa/</link><description>Recent content in RSA on</description><generator>Hugo -- gohugo.io</generator><lastBuildDate>Thu, 17 Jul 2025 17:22:16 +0100</lastBuildDate><atom:link href="/tags/rsa/index.xml" rel="self" type="application/rss+xml"/><item><title>OK Computer - SummerRush CTF</title><link>/post/sr25-ok-computer/</link><pubDate>Thu, 17 Jul 2025 17:22:16 +0100</pubDate><guid>/post/sr25-ok-computer/</guid><description>Click to expand challenge code
from Crypto.Util.number import getPrime, bytes_to_long flag = &amp;quot;FL1TZ{*********}&amp;quot; p = getPrime(512) q = getPrime(512) n = p * q e = 5 m = bytes_to_long(flag.encode()) c = pow(m, e, n) data = { &amp;quot;n&amp;quot;: n, &amp;quot;e&amp;quot;: e, &amp;quot;c&amp;quot;: c } with open(&amp;quot;computer.json&amp;quot;, &amp;quot;w&amp;quot;) as f: import json json.dump(data, f, indent=4)
Since this CTF was destined to be pretty advanced, I didn&amp;rsquo;t want beginner players to leave with 0 solves.</description></item></channel></rss>