<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Computer Science on Prepakis Georgios | Kernelstub | Security Researcher</title><link>https://blog.kernelstub.dev/tags/computer-science/</link><description>Recent content in Computer Science on Prepakis Georgios | Kernelstub | Security Researcher</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Tue, 14 Jan 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.kernelstub.dev/tags/computer-science/index.xml" rel="self" type="application/rss+xml"/><item><title>Advanced Cryptography Concepts via Classical to Post-Quantum</title><link>https://blog.kernelstub.dev/posts/advanced-cryptography-concepts-via-classical-to-post-quantum/</link><pubDate>Tue, 14 Jan 2025 00:00:00 +0000</pubDate><guid>https://blog.kernelstub.dev/posts/advanced-cryptography-concepts-via-classical-to-post-quantum/</guid><description>&lt;p&gt;Cryptography has a strange history for a field that&amp;rsquo;s now load-bearing for the entire internet. A lot of the number theory underneath it was developed by mathematicians who were doing pure math for its own sake, with zero interest in secrets or spies. Then, starting in the 1970s, people realized that certain &amp;ldquo;hard&amp;rdquo; problems in number theory (the kind that are easy to state but brutal to solve at scale) were exactly what you needed to build systems where two strangers could agree on a secret over a public channel, or where you could prove your identity without ever handing over a password. This post is a walk through that stack, from the classical number-theoretic foundations, through the protocols built on top of them, and finally into the post-quantum schemes that exist because a sufficiently large quantum computer would tear a hole through most of what came before.&lt;/p&gt;</description></item><item><title>Introduction to Quantum Computing</title><link>https://blog.kernelstub.dev/posts/introduction-to-quantum-computing/</link><pubDate>Tue, 14 Jan 2025 00:00:00 +0000</pubDate><guid>https://blog.kernelstub.dev/posts/introduction-to-quantum-computing/</guid><description>&lt;p&gt;Quantum computing gets talked about like it&amp;rsquo;s some kind of magic trick: a machine that tries every answer at once and just knows the right one. That&amp;rsquo;s a fun story, but it&amp;rsquo;s not really what&amp;rsquo;s happening, and understanding &lt;em&gt;why&lt;/em&gt; it&amp;rsquo;s not what&amp;rsquo;s happening is the fastest way to actually get quantum computing instead of just repeating buzzwords about it. So let&amp;rsquo;s slow down and build this up from the physics, piece by piece, and see how it turns into something you can actually run algorithms on.&lt;/p&gt;</description></item></channel></rss>