Blog

We take a leap into the world of zero-knowledge proofs by exploring one of the many ZKP protocols out there: Bulletproofs

A brief introduction to pairings, an important tool in modern cryptography

Polynomials play an important role in many cryptographic applications. This article is dedicated to giving a brief intro to the topic

A gentle introduction to some very useful schemes: key exchange, commitment schemes, zero-knowledge proofs, verifiable random functions

An expansion upon the ideas behind simpler commitment schemes, providing important tools for more complex constructions down the road

Short summary of some important aspect of security in cryptography

A deeper dive into core concepts of groups, and a fascinating application: homomorphic encryption

A short explanation on how RSA works

Following our presentation of pairings, we look at a couple more applications enabled by this new tool

Combining polynomials and digital signatures brings forth a cool new functionality, in the form of Threshold Signatures!

A quick look at some slightly more elaborate signature schemes than usual

Hashing functions are an essential cryptographic primitive. Join me in a deep dive into what they are, and what they are used for!