PSE Blog has moved! You can now find all our latest research, blog posts, and updates at our new home 👉 https://pse.dev/en/blog
We're moving! 👋
This will be our last post here on Mirror. From now on, all new updates and blog posts from the PSE team will be published at https://pse.dev/blog. Thanks for following us here, we'll see you at our new home. 🏠
We're moving! 👋
This will be our last post here on Mirror. From now on, all new updates and blog posts from the PSE team will be published at https://pse.dev/blog. Thanks for following us here, we'll see you at our new home. 🏠
Code Optimizations in the Landscape of Post-Quantum Cryptography
This post was written by PSE researcher Miha Stopar. There's no doubt that lattice-based cryptography is currently the most promising branch of post-quantum cryptography. Not only is it highly performant and versatile, it also provides the only known technique to achieve fully homomorphic encryption. One reason lattice-based cryptography is so fast is that it can be heavily vectorized. This contrasts noticeably with isogeny-based cryptography, which offers far fewer opportunities for par...
Code Optimizations in the Landscape of Post-Quantum Cryptography
This post was written by PSE researcher Miha Stopar. There's no doubt that lattice-based cryptography is currently the most promising branch of post-quantum cryptography. Not only is it highly performant and versatile, it also provides the only known technique to achieve fully homomorphic encryption. One reason lattice-based cryptography is so fast is that it can be heavily vectorized. This contrasts noticeably with isogeny-based cryptography, which offers far fewer opportunities for par...
Circom MPC: TL;DR and Retrospective
This post was authored by the Circom MPC research team. Circom-MPC is a PSE Research project that enables the use of the Circom language to develop MPC applications. In this project, we envisioned MPC as a broader paradigm, where MPC serves as an umbrella for generic techniques such as Zero-Knowledge Proof, Garbled Circuit, Secret-Sharing, or Fully Homomorphic Encryption. Throughout this research the team produced some valuable resources and insights, including:Implementation of circom-2-arit...
Circom MPC: TL;DR and Retrospective
This post was authored by the Circom MPC research team. Circom-MPC is a PSE Research project that enables the use of the Circom language to develop MPC applications. In this project, we envisioned MPC as a broader paradigm, where MPC serves as an umbrella for generic techniques such as Zero-Knowledge Proof, Garbled Circuit, Secret-Sharing, or Fully Homomorphic Encryption. Throughout this research the team produced some valuable resources and insights, including:Implementation of circom-2-arit...
Intmax: a scalable payment L2 from plasma and validity proofs
This post was written by PSE researcher Pierre and originally posted on his personal blog. Thanks to the Intmax team for their helpful review on this post!Intmax has been pioneering L2 transaction-only constructions based on client-side validation (CSV), where transaction validation relies on cryptographic proofs rather than blockchain consensus rules. Data is intermittently posted on a dedicated blockchain, primarily for deposits, withdrawals, and account checkpoints. The Intmax2 paper is an...
Intmax: a scalable payment L2 from plasma and validity proofs
This post was written by PSE researcher Pierre and originally posted on his personal blog. Thanks to the Intmax team for their helpful review on this post!Intmax has been pioneering L2 transaction-only constructions based on client-side validation (CSV), where transaction validation relies on cryptographic proofs rather than blockchain consensus rules. Data is intermittently posted on a dedicated blockchain, primarily for deposits, withdrawals, and account checkpoints. The Intmax2 paper is an...
Lattice-Based Proof Systems
This post was written by PSE researcher Miha Stopar. Post-quantum cryptography (PQC) is important because it addresses the potential threat posed by quantum computers to classical cryptographic systems. Quantum computers leverage the principles of quantum mechanics to perform calculations exponentially faster than classical computers in certain cases. Two algorithms, in particular, pose significant threats:Shor’s Algorithm: Efficiently solves integer factorization and discrete logarithm probl...
Lattice-Based Proof Systems
This post was written by PSE researcher Miha Stopar. Post-quantum cryptography (PQC) is important because it addresses the potential threat posed by quantum computers to classical cryptographic systems. Quantum computers leverage the principles of quantum mechanics to perform calculations exponentially faster than classical computers in certain cases. Two algorithms, in particular, pose significant threats:Shor’s Algorithm: Efficiently solves integer factorization and discrete logarithm probl...
