<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Post-Quantum Cryptography on Adrien&#39;s Dashbook</title>
    <link>https://adrbqt.ch/tags/post-quantum-cryptography/</link>
    <description>Recent content in Post-Quantum Cryptography on Adrien&#39;s Dashbook</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 20 Jun 2025 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://adrbqt.ch/tags/post-quantum-cryptography/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Constant-Time client-side FHE operations</title>
      <link>https://adrbqt.ch/writings/constant-time-client-side-fhe-operations/constant-time-fhe/</link>
      <pubDate>Fri, 20 Jun 2025 00:00:00 +0000</pubDate>
      <guid>https://adrbqt.ch/writings/constant-time-client-side-fhe-operations/constant-time-fhe/</guid>
      <description>&lt;p&gt;&lt;em&gt;This paper was written under the supervision of Ph. D. candidate Christian Knabenhans and Prof. Carmela Troncoso from SPRING Lab at EPFL and is available in PDF format &lt;a href=&#34;../../docs/constant-time-FHE.pdf&#34;&gt;here&lt;/a&gt;&lt;/em&gt;.&lt;/p&gt;&#xA;&lt;html xmlns=&#34;http://www.w3.org/1999/xhtml&#34; lang=&#34;&#34; xml:lang=&#34;&#34;&gt;&#xA;&lt;meta charset=&#34;utf-8&#34; /&gt;&#xA;&lt;meta name=&#34;generator&#34; content=&#34;pandoc&#34; /&gt;&#xA;&lt;meta name=&#34;viewport&#34; content=&#34;width=device-width, initial-scale=1.0, user-scalable=yes&#34; /&gt;&#xA;&lt;meta name=&#34;author&#34; content=&#34;Adrien Bouquet&#34; /&gt;&#xA;&lt;script defer=&#34;&#34; src=&#34;https://cdn.jsdelivr.net/npm/katex@latest/dist/katex.min.js&#34;&gt;&lt;/script&gt;&#xA;&lt;script&gt;document.addEventListener(&#34;DOMContentLoaded&#34;, function () {&#xA;    var mathElements = document.getElementsByClassName(&#34;math&#34;);&#xA;    var macros = [];&#xA;    for (var i = 0; i &lt; mathElements.length; i++) {&#xA;      var texText = mathElements[i].firstChild;&#xA;      if (mathElements[i].tagName == &#34;SPAN&#34;) {&#xA;        katex.render(texText.data, mathElements[i], {&#xA;          displayMode: mathElements[i].classList.contains(&#39;display&#39;),&#xA;          throwOnError: false,&#xA;          macros: macros,&#xA;          fleqn: false&#xA;        });&#xA;      }&#xA;    }&#xA;  });&#xA;&lt;/script&gt;&#xA;&lt;link rel=&#34;stylesheet&#34; href=&#34;https://cdn.jsdelivr.net/npm/katex@latest/dist/katex.min.css&#34; /&gt;&#xA;&lt;style&gt;&#xA;  div.csl-bib-body {}&#xA;&#xA;    div.csl-entry {&#xA;      clear: both;&#xA;      margin-bottom: 0em;&#xA;    }&#xA;&#xA;    .hanging-indent div.csl-entry {&#xA;      margin-left: 2em;&#xA;      text-indent: -2em;&#xA;    }&#xA;&#xA;    div.csl-left-margin {&#xA;      min-width: 2em;&#xA;      float: left;&#xA;    }&#xA;&#xA;    div.csl-right-inline {&#xA;      margin-left: 2em;&#xA;      padding-left: 1em;&#xA;    }&#xA;&#xA;    div.csl-indent {&#xA;      margin-left: 2em;&#xA;    }&#xA;&lt;/style&gt;&#xA;&lt;body&gt;&#xA;  &lt;!-- &#xA;To compile the document:&#xA;&#xA;pandoc REPORT.md --bibliography=references.bib --csl=ieee.csl --citeproc --pdf-engine=pdflatex -o report.pdf &#xA;--&gt;&#xA;  &lt;!-- \newcommand{\MLKEM}{ML-KEM} --&gt;&#xA;  &lt;!-- Fully Homomorphic Encryption, or FHE, is a powerful cryptographic scheme and a privacy-preserving technology. It has a wide range of application such as Secure Cloud Computing, Healthcare Data Processing, or  --&gt;&#xA;  &lt;!---&#xA;Maybe Cite the original paper of FHE ?&#xA;--&gt;&#xA;  &lt;!-- Audience are Master students with the same level of expertise as mine&#xA;START WITH THE RELATED WORKS, TECHNICAL SECTION AND THE RESULTS FIRST --&gt;&#xA;  &lt;!-- &lt;h2 data-number=&#34;1&#34; id=&#34;introduction&#34;&gt;&lt;span class=&#34;header-section-number&#34;&gt;1&lt;/span&gt; Introduction&lt;/h2&gt; --&gt;&#xA;&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;  &lt;p&gt;The development of quantum computers presents a significant threat to&#xA;    classical Public-Key cryptographic systems. Many widely deployed&#xA;    cryptographic primitives, such as RSA, Diffie-Hellman, and Elliptic&#xA;    Curve Cryptography (ECC)—rely on the hardness of integer factorization&#xA;    or the discrete logarithm problem. These problems are vulnerable to&#xA;    quantum computers, and therefore enhance research on post-quantum&#xA;    cryptographic scheme.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
