<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Section: "Unix" on Chris Kiriakous Website</title><link>https://ckiri.com/en/tags/unix/</link><description>Recent in "Unix" on Chris Kiriakous Website</description><generator>Hugo</generator><language>en-US</language><managingEditor>c@ckiri.com (Chris Kiriakou)</managingEditor><webMaster>c@ckiri.com (Chris Kiriakou)</webMaster><lastBuildDate>Tue, 30 Sep 2025 16:12:06 +0200</lastBuildDate><atom:link href="https://ckiri.com/en/tags/unix/index.xml" rel="self" type="application/rss+xml"/><item><title>GNU Coreutils Codegolf</title><link>https://ckiri.com/en/posts/coreutils/</link><pubDate>Tue, 30 Sep 2025 16:12:06 +0200</pubDate><author>c@ckiri.com (Chris Kiriakou)</author><guid>https://ckiri.com/en/posts/coreutils/</guid><description>&lt;p&gt;I recently saw some fancy Perl one-liners and ed/sed scripts that do some&#10;incredible stuff with little to no effort. This inspired me to create one&#10;myself: A one-liner that decrypts a substitution cipher. In short,&#10;a substitution cipher is one of the more simpler (and also more unsafe)&#10;ciphers. It works by simply substituting one letter by another. Even though it&#10;is practically not breakable by brute-forcing it (due to its large keyspace:&#10;&#10; &lt;span class="katex"&gt;&lt;math xmlns="http://www.w3.org/1998/Math/MathML"&gt;&lt;semantics&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mn&gt;88&lt;/mn&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;annotation encoding="application/x-tex"&gt;2^{88}&lt;/annotation&gt;&lt;/semantics&gt;&lt;/math&gt;&lt;/span&gt;&#10; , it is prone to crypto analysis. Calculating the letter frequency of&#10;a cipher allows one to replace each letter’s position with the corresponding&#10;frequency position in a given language&lt;sup id="fnref:1"&gt;&lt;a href="#fn:1" class="footnote-ref" role="doc-noteref"&gt;1&lt;/a&gt;&lt;/sup&gt;.&lt;/p&gt;</description></item></channel></rss>