<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Crypto on Bitsdeep</title><link>https://bitsdeep.com/categories/crypto/</link><description>Recent content in Crypto on Bitsdeep</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2024 ENOENT</copyright><lastBuildDate>Tue, 10 Sep 2024 00:00:00 +0000</lastBuildDate><atom:link href="https://bitsdeep.com/categories/crypto/index.xml" rel="self" type="application/rss+xml"/><item><title>FCSC 2024 - Write-Ups for the crypto challenges</title><link>https://bitsdeep.com/posts/fcsc-2024-write-ups-for-the-crypto-challenges/</link><pubDate>Tue, 10 Sep 2024 00:00:00 +0000</pubDate><guid>https://bitsdeep.com/posts/fcsc-2024-write-ups-for-the-crypto-challenges/</guid><description>&lt;p>In this post, I&amp;rsquo;ll present my write-ups for all the challenges listed in the crypto category, ordered by difficulty rating.&lt;/p>
&lt;p>The challenges are:&lt;/p>
&lt;ol>
&lt;li>AdveRSArial Crypto (Baby)&lt;/li>
&lt;li>El Gamal Fait 1/2&lt;/li>
&lt;li>El Gamal Fait 2/2&lt;/li>
&lt;li>The pake is a lie&lt;/li>
&lt;li>AdveRSArial Crypto (Kiddo)&lt;/li>
&lt;li>Broadcastopol&lt;/li>
&lt;li>Salade de fruits&lt;/li>
&lt;li>Share a Saucisse&lt;/li>
&lt;li>Winternitz is coming&lt;/li>
&lt;li>Appellation d&amp;rsquo;Origine Protégée&lt;/li>
&lt;li>Secret SHenanigans&lt;/li>
&lt;li>Tight Schedule&lt;/li>
&lt;/ol></description></item><item><title>Breaking Python's PRNG with a few values and no bruteforce</title><link>https://bitsdeep.com/projects/python-random-prediction/</link><pubDate>Mon, 22 Apr 2024 00:00:00 +0000</pubDate><guid>https://bitsdeep.com/projects/python-random-prediction/</guid><description>In this project, our focus will be on Python’s random implementation. We’ll demonstrate that even with a small number of outputs (as few as 6 for a 32-bit seed), it’s feasible to deduce Python’s original seed.</description></item><item><title>KalmarCTF 2024 - One key to rule them all</title><link>https://bitsdeep.com/posts/kalmarctf-2024-one-key-to-rule-them-all/</link><pubDate>Mon, 18 Mar 2024 23:04:35 +0000</pubDate><guid>https://bitsdeep.com/posts/kalmarctf-2024-one-key-to-rule-them-all/</guid><description>Encryption is easy, but key management is hard - I got the solution! Just use one key everywhere, i.e. nothing to manage (just don&amp;rsquo;t lose it)</description></item><item><title>FCSC 2022 - Write-Ups for some of the crypto challenges</title><link>https://bitsdeep.com/posts/fcsc-2022-write-ups-for-some-of-the-crypto-challenges/</link><pubDate>Thu, 19 May 2022 19:34:04 +0000</pubDate><guid>https://bitsdeep.com/posts/fcsc-2022-write-ups-for-some-of-the-crypto-challenges/</guid><description>&lt;p>In this post, I&amp;rsquo;ll present my write-ups for some of the challenges listed in the crypto category, in no particular order.&lt;/p>
&lt;p>The challenges are:&lt;/p>
&lt;ol>
&lt;li>Shuffled&lt;/li>
&lt;li>My Tailor is Rich&lt;/li>
&lt;li>T-Rex&lt;/li>
&lt;li>Gaston La Paffe&lt;/li>
&lt;li>Surface&lt;/li>
&lt;li>Hash-ish&lt;/li>
&lt;li>Kahl Hash&lt;/li>
&lt;li>Share It&lt;/li>
&lt;li>IZNOGOOD&lt;/li>
&lt;li>Millenium&lt;/li>
&lt;/ol>
&lt;p>I didn&amp;rsquo;t manage to solve two of them, but I will briefly give my thoughts on them.&lt;/p></description></item><item><title>FCSC 2021 - Write-Ups for the crypto challenges</title><link>https://bitsdeep.com/posts/fcsc-2021-write-ups-for-the-crypto-challenges/</link><pubDate>Mon, 03 May 2021 16:00:49 +0000</pubDate><guid>https://bitsdeep.com/posts/fcsc-2021-write-ups-for-the-crypto-challenges/</guid><description>&lt;p>In this post, I&amp;rsquo;ll present my write-ups for all the challenges listed in the Crypto category, in the order I solved them during the competition.&lt;/p>
&lt;p>The challenges are:&lt;/p>
&lt;ol>
&lt;li>Macaque&lt;/li>
&lt;li>RSA Destroyer&lt;/li>
&lt;li>Lost curve&lt;/li>
&lt;li>Hashy Parmentier&lt;/li>
&lt;li>Revaulting&lt;/li>
&lt;li>SmeaLog&lt;/li>
&lt;li>Trappy Skippy&lt;/li>
&lt;/ol></description></item><item><title>Analysis of the ROCA vulnerability</title><link>https://bitsdeep.com/posts/analysis-of-the-roca-vulnerability/</link><pubDate>Mon, 04 May 2020 11:20:00 +0000</pubDate><guid>https://bitsdeep.com/posts/analysis-of-the-roca-vulnerability/</guid><description>In this post we will see how the key generation process is done, why it is bad and how other people have been able to rediscover the attack before it was publicly disclosed. We will also see how the detection methods work and most importantly how to perform the whole attack. Hopefully at the end you will understand all the steps required to factor vulnerable keys and how the necessary optimizations of the attack where found. As a bonus, I&amp;rsquo;ll provide a fully functional multiprocess attack script in Sage.</description></item><item><title>Solving RE tasks the crypto way</title><link>https://bitsdeep.com/posts/solving-re-tasks-the-crypto-way/</link><pubDate>Mon, 19 Aug 2019 08:45:14 +0000</pubDate><guid>https://bitsdeep.com/posts/solving-re-tasks-the-crypto-way/</guid><description>&lt;p>In this post I want to share with you my way of solving reverse engineering (RE) tasks in CTFs involving simple cryptography without reading a single bit of assembly, purely by cryptanalysis.&lt;/p>
&lt;p>Of course this can&amp;rsquo;t be applied on all RE tasks you&amp;rsquo;ll encounter that make use of cryptography, but sometimes it might save you a lot of pain trying to solve a difficult RE task. You might also have to do it simply because you don&amp;rsquo;t have access to the cryptographic code (Black Box), like in one of the parts of the Black Badge challenge for Le Hack 2019, which will serve as an example throughout this post.&lt;/p></description></item><item><title>Attacking RSA for fun and CTF points - part 4</title><link>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-4/</link><pubDate>Thu, 27 Jun 2019 08:19:05 +0000</pubDate><guid>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-4/</guid><description>&lt;p>It&amp;rsquo;s been a long time since part 3 of this series. So to quietly resume our journey in the beautiful world of mathematics I propose you 4 rather simple topics :&lt;/p>
&lt;ul>
&lt;li>Multi-prime RSA&lt;/li>
&lt;li>Brute force attack on small secret CRT-Exponents&lt;/li>
&lt;li>Fault attack on signatures&lt;/li>
&lt;li>Twin primes&lt;/li>
&lt;/ul></description></item><item><title>Analysing the worst ransomware - part 2</title><link>https://bitsdeep.com/posts/analysing-the-worst-ransomware-part-2/</link><pubDate>Wed, 26 Sep 2018 11:10:52 +0000</pubDate><guid>https://bitsdeep.com/posts/analysing-the-worst-ransomware-part-2/</guid><description>In the last part we have seen that Tupper encrypts &amp;ldquo;.txt&amp;rdquo; files using RSA and &amp;ldquo;.pdf&amp;rdquo; files using a xor and custom key schedule. In this part we will write decryption scripts to recover encrypted files because Tupper doesn&amp;rsquo;t provide any decryption function.</description></item><item><title>Attacking RSA for fun and CTF points - part 3</title><link>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-3/</link><pubDate>Sun, 15 Jul 2018 17:24:33 +0000</pubDate><guid>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-3/</guid><description>&lt;p>Today the focus is on oracles ! You already encountered the decipher oracle in part 1 but now you&amp;rsquo;ll meet :&lt;/p>
&lt;ol>
&lt;li>The LSB oracle&lt;/li>
&lt;li>The padding oracle&lt;/li>
&lt;/ol></description></item><item><title>Attacking RSA for fun and CTF points - part 2</title><link>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-2/</link><pubDate>Fri, 25 May 2018 17:37:59 +0000</pubDate><guid>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-2/</guid><description>&lt;p>Before diving right into more advanced attacks, let&amp;rsquo;s take a minute to do a quick recap because it&amp;rsquo;s been a long time since the last part. Once your mind is warmed up you can safely move on.&lt;/p>
&lt;p>On the program today you have :&lt;/p>
&lt;ol>
&lt;li>Small public exponent&lt;/li>
&lt;li>Hastad broadcast attack&lt;/li>
&lt;li>Fermat&amp;rsquo;s attack&lt;/li>
&lt;li>Wiener&amp;rsquo;s attack&lt;/li>
&lt;/ol></description></item><item><title>Attacking RSA for fun and CTF points - part 1</title><link>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-1/</link><pubDate>Fri, 13 Apr 2018 14:00:31 +0000</pubDate><guid>https://bitsdeep.com/posts/attacking-rsa-for-fun-and-ctf-points-part-1/</guid><description>&lt;p>RSA is my favorite cryptosystem. It&amp;rsquo;s simple and powerful.&lt;/p>
&lt;p>In this series I will try to go through every attacks (that I&amp;rsquo;m aware of) against RSA which are useful for solving CTF tasks.
I&amp;rsquo;m not going to give you scripts that will do all the work for you but rather explain how the attacks work. The aim of this series is to understand the attacks you use and which one is most appropriate depending on the task. I will try to be beginner friendly and repeat myself in the beginning but afterwards I will assume that the reader has learnt the concepts.&lt;/p>
&lt;p>Our first attacks will be :&lt;/p>
&lt;ol>
&lt;li>Common modulus&lt;/li>
&lt;li>Decipher oracle&lt;/li>
&lt;/ol></description></item><item><title>EasyCTF IV - RSA V</title><link>https://bitsdeep.com/posts/easyctf-iv-rsa-v/</link><pubDate>Wed, 21 Feb 2018 14:20:07 +0000</pubDate><guid>https://bitsdeep.com/posts/easyctf-iv-rsa-v/</guid><description>Bob is extremely paranoid, so he decided that just one RSA encryption is not enough. Before sending his message to Alice, he forced her to create 5 public keys so he could encrypt his message 5 times! Show him that he still is not secure&amp;hellip;</description></item><item><title>EasyCTF IV - Not OTP</title><link>https://bitsdeep.com/posts/easyctf-iv-not-otp/</link><pubDate>Wed, 21 Feb 2018 13:23:12 +0000</pubDate><guid>https://bitsdeep.com/posts/easyctf-iv-not-otp/</guid><description>It seems we&amp;rsquo;ve intercepted 2 strings that were both encrypted with what looks like OTP! Is it possible to decrypt them?</description></item><item><title>Hackim18 - Web1</title><link>https://bitsdeep.com/posts/hackim18-web1/</link><pubDate>Tue, 13 Feb 2018 22:01:20 +0000</pubDate><guid>https://bitsdeep.com/posts/hackim18-web1/</guid><description>&lt;p>The objective of this challenge is to find a way to get logged in as the user &amp;ldquo;administrator&amp;rdquo;.&lt;/p>
&lt;p>This is the demo application for our new session management system based on military cryptography (namely CBC-MAC). You can log in as any user (except &amp;lsquo;administrator&amp;rsquo;) with the password &amp;lsquo;Password1&amp;rsquo;. We blocked access to &amp;lsquo;administrator&amp;rsquo; account for security reasons.&lt;/p></description></item><item><title>Hackim18-What did he said ?</title><link>https://bitsdeep.com/posts/hackim18-what-did-he-said/</link><pubDate>Tue, 13 Feb 2018 21:10:23 +0000</pubDate><guid>https://bitsdeep.com/posts/hackim18-what-did-he-said/</guid><description>&lt;p>By his grace, we have been successfully organizing nullcon, year on year and this is the Nullcon9. At this juncture we cannot forget what did he had said, the one panacea given by him…&lt;/p>
&lt;p>In 2010 when we were all worried, how can we be successful with this first ever event…&lt;/p></description></item></channel></rss>