<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Encryption on 0xGently</title><link>https://0xgently.github.io/en/tags/encryption/</link><description>Recent content in Encryption on 0xGently</description><generator>Hugo</generator><language>en</language><copyright>Content is licensed under CC BY 4.0. © 0xGently</copyright><lastBuildDate>Mon, 20 Apr 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://0xgently.github.io/en/tags/encryption/index.xml" rel="self" type="application/rss+xml"/><item><title>RC4 Encryption</title><link>https://0xgently.github.io/en/posts/rc4/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://0xgently.github.io/en/posts/rc4/</guid><description>&lt;h2 id="rc4-encryption"&gt;RC4 Encryption&lt;/h2&gt;
&lt;p&gt;RC4 is a symmetric stream cipher that encrypts data byte by byte rather than in blocks. Under the hood, it consists of two primary phases: the Key-Scheduling Algorithm (KSA), where the key is initialized and permuted in memory, and the Pseudo-Random Generation Algorithm (PRGA), which generates keystream bytes to be XORed with the data. Thanks to its symmetric architecture, the exact same routine is utilized for both encryption and decryption.&lt;/p&gt;</description></item><item><title>XOR Encryption</title><link>https://0xgently.github.io/en/posts/xor/</link><pubDate>Wed, 15 Apr 2026 00:00:00 +0000</pubDate><guid>https://0xgently.github.io/en/posts/xor/</guid><description>&lt;h2 id="xor-encryption"&gt;XOR Encryption&lt;/h2&gt;
&lt;p&gt;In the world of malware development, one of the most critical factors determining the lifespan of your payload is how effectively you can conceal it. If you embed shellcode or a PE file into memory in plain text, static analysis tools and antivirus (AV) signatures will flag it within seconds.&lt;/p&gt;
&lt;p&gt;This is precisely where payload encryption comes into play. In this post, we will examine the XOR algorithm—one of the most fundamental yet heavily modified encryption techniques in the malware domain. We will start from the basics and progress toward complex, position-dependent rolling structures.&lt;/p&gt;</description></item><item><title>Chacha20 Encryption</title><link>https://0xgently.github.io/en/posts/chacha20/</link><pubDate>Wed, 01 Apr 2026 00:00:00 +0000</pubDate><guid>https://0xgently.github.io/en/posts/chacha20/</guid><description>&lt;h2 id="chacha20-encryption"&gt;ChaCha20 Encryption&lt;/h2&gt;
&lt;p&gt;In this post, I will talk about ChaCha20. Frankly, I thought about how to introduce the topic, but I couldn&amp;rsquo;t come up with a sensible introductory sentence. Therefore, I prefer to dive straight into the subject.&lt;/p&gt;
&lt;p&gt;File size and simplicity are everything. There is only one reason we prefer ChaCha20: it is compact, fast, and eliminates the need to write an extra decryption routine.&lt;/p&gt;
&lt;p&gt;So why do we choose ChaCha20? Because it is exceptionally fast, does not rely on dedicated CPU cryptographic hardware extensions (such as AES-NI), and is far less cumbersome to implement from scratch in C/C++. Furthermore, we use the exact same code for both encryption and decryption, which minimizes the overall stub size of the software.&lt;/p&gt;</description></item></channel></rss>