<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Posts on Approachable Cryptography</title>
    <link>/posts/</link>
    <description>Recent content in Posts on Approachable Cryptography</description>
    <generator>Hugo -- gohugo.io</generator>
    <copyright>CC-BY-SA
</copyright>
    <lastBuildDate>Tue, 14 Sep 2021 00:00:00 +0000</lastBuildDate><atom:link href="/posts/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Kyber - How does it work?</title>
      <link>/posts/kyber/</link>
      <pubDate>Tue, 14 Sep 2021 00:00:00 +0000</pubDate>
      
      <guid>/posts/kyber/</guid>
      <description>This blog post describes the post-quantum cryptography (PQC) system Kyber, which is a finalist in NIST&amp;rsquo;s PQC competition. In the first section I&amp;rsquo;ll introduce post-quantum crypto and give some background on Kyber. Then I&amp;rsquo;ll describe the concrete system by looking at a minified version. The last section will cover remaining technical details and security claims.
Kyber and Post-Quantum Crypto Already in the early 2000s cryptographers got increasingly worried about potential advances in quantum computing. Since Peter Shor published his famous Shor&amp;rsquo;s Algorithm we know that a large enough quantum computer would break all widely used public key systems.</description>
    </item>
    
  </channel>
</rss>
