<img src="/assets/images/miracl-blog-iStock-680270994.jpg" alt="iStock-680270994.jpg" width="1199" height="899"> <p>In our last blog, <a href="/blog/post-quantum-cryptography-for-grandparents" target="_blank" title="Post Quantum Cryptography for Grandparents">“Post Quantum Cryptography for Grandparents”</a>, (which you really need to read first before reading this one) we pointed out that Post-Quantum cryptography as based on the Ring Learning with Errors (RLWE) problem, can actually be quite easy to understand, despite its rather terrifying terminology.</p> <p>Its based on this one-way function</p> <p><strong><em>B=As+e</em></strong></p> <p>Where <em>A</em> and <em>B</em> are “large” polynomials and <em>s</em> and <em>e</em> are “small” polynomials. Given <em>A</em> , <em>s</em> and <em>e</em> , its easy to calculate <em>B</em>, its just a multiplication followed by an addition. However given <em>B</em> and <em>A</em> , its very hard to calculate <em>s</em> and <em>e</em> . Even a quantum computer can’t do it. That’s why we call it one-way.</p>…