All the articles I've posted.
Elliptic Curve Pairing
An Elliptic Curve Pairing is a function that maps two Elliptic Curve Points to an element of another group like a finite field.
Shamir's Secret Sharing
Shamir's Secret Sharing allows for a secret to be shared among multiple protocol participants out of which a threshold have to collaborate to reconstruct it.
Ring Signatures allow for a signer to hide a valid signature among a collection of other "mock signatures" that were produced by "co-signers" such that it's impossible to determine who produced the valid signature.
The Chaum-Pedersen Protocol allows a prover to interactively prove to a verifier that they know a secret value without revealing it.
Schnorr Adaptor Signature
A Schnorr Signature can be modified to create an adaptor signature that only verifies when a secret value is applied which itself is revealed upon verification.
Schnorr Signature Aggregation
The Schnorr Signature Protocol can be setup such that the secret key is shared among a group of participants so that all need to collaborate to produce a valid signature.
The Schnorr Signature Protocol allows a prover to non-interactively prove to a verifier that they know a secret value without revealing it.
Schnorr Identification Protocol
The Schnorr Identification Protocol allows a prover to interactively prove to a verifier that they know a secret value without revealing it.
ElGamal Encryption is an asymmetric cryptosystem that allows for the exchange of encrypted messages over an insecure channel.
With Computational Security we analyze how likely it is that a cryptographic construction will be broken in the real world.
Entropy is a way to quantify how much uncertainty a probability distribution exhibits.
With Information-Theoretic Security we analyze if a cryptographic construction is theoretically impossible to break.
The One-Time Pad is a symmetric cipher that when used properly can be proven to be unbreakable.
A security notion is a standardized way to convey security guarantees of cryptographic constructions.
Probability is an important topic in Cryptography as it allows for the expression and calculation of likelihoods.
Given it's invertibility and perfect balance, XOR is used in a lot of cryptographic constructions.
Substitution and Permutation
To ensure strong Confusion and Diffusion properties, ciphers utilize Substitutions and Permutations.
Confusion and Diffusion
Confusion and Diffusion are two properties that should be incorporated into ciphers to make them secure against statistical attacks and other methods of Cryptanalysis.
Random Number Generator
Randomness is one of the core building blocks in Cryptography which is usually derived via a Random Number Generator.
Elliptic Curve Diffie-Hellman
Elliptic Curve Diffie-Hellman is used to derive a shared secret over an insecure channel.
Message Authentication Code
MACs are used to ensure that a message originated from the correct sender and hasn't been tampered with.
Hash Functions are used to map arbitrary-length data to fixed-size values in a collision-resistant- and non-reversible way.
A High-level Overview of Modern Cryptography
This is an introductory blog post for everyone interested in modern Cryptography.
How to implement LP-Tokens in Cairo
Learn how to implement LP-Tokens in Cairo.
How to implement LP-Tokens in Solidity
Learn how to implement LP-Tokens in Solidity.
How to implement LP-Tokens
Learn what LP-Tokens used in DeFi Protocols are and how they work.
How to calculate percentages in Solidity
Learn how you to implement percentage calculations in Solidity.
The all-new CryptoDevHub
Explore what has changed and how you can use it to learn Blockchain development.
An actively maintained collection of notes I created throughout my learning journey.
A curated list of resources useful when studying Cryptography and its applications.