Cryptography

ML-DSA in Rust — Inside the Quantus qp-rusty-crystals Implementation

How the Quantus qp-rusty-crystals crate implements FIPS 204 ML-DSA in no_std Rust, from const-generic parameter sets to streaming matrix expansion.

2026, Aug 25   — 

SHAKE128 — The Extendable-Output Function of the SHA-3 Standard (FIPS 202)

How SHAKE128 (FIPS 202) turns the Keccak sponge into an extendable-output function, with its rate, capacity, domain separation and related-output hazard.

2026, Aug 24   — 

The SHA-3 Standard (FIPS 202) — A Second Family of Hash Functions

Why NIST ran a hash competition, what FIPS 202 standardized, how the four SHA3 hash functions differ from SHA-2, and the rules governing their approved use.

2026, Aug 24   — 

When the Hardware RNG Was Not Called - Anatomy of an Entropy Defect

A wallet firmware generated seeds with far less entropy than intended because a linker resolved rng_get() to a software PRNG. How the defect worked, why XOR whitening hid it, and what catches this class of bug.

2026, Jul 31   — 

COLDCARD Firmware - Architecture and Security Model

How the COLDCARD hardware wallet firmware works - the bootloader/MicroPython split, dual secure elements, PIN key stretching, trick PINs, signed firmware, and reproducible builds.

2026, Jul 31   — 

Zero-Knowledge Proof Systems — 15 Concepts and 15 Formulas to Read the Foundational Papers

A study guide to the foundational zero-knowledge proof papers. Fifteen technical concepts and fifteen formulas that recur across GKR, Pinocchio, Groth16, Bulletproofs, STARKs, Sonic, Marlin, Spartan, Halo, Nova and Zerocash.

2026, Jul 28   — 

Zero-Knowledge Proofs in the Zama Protocol — What They Prove and Where They Are Verified

How the Zama Confidential Blockchain Protocol uses zero-knowledge proofs of knowledge on encrypted inputs, which proof system TFHE-rs relies on, where the proof is verified, and why the calldata inputProof holds signatures rather than the proof.

2026, Jul 24   — 

The IPsec and IKE Document Roadmap (RFC 6071)

A guided tour of RFC 6071, the roadmap that maps the sprawling IPsec and IKE RFC landscape - the seven document groups, IPsec-v2 vs v3, IKEv1 vs IKEv2, extensions, and crypto requirement levels.

2026, Jul 20   — 

HOTP - An HMAC-Based One-Time Password Algorithm (RFC 4226)

How HOTP (RFC 4226) turns a shared secret and a counter into a 6-digit one-time password using HMAC-SHA-1 and dynamic truncation, with its security analysis, validation rules, and link to TOTP.

2026, Jul 20   — 

How Two Computers Agree on a Secret Code That a Quantum Computer Cannot Steal — Explained for a 10-Year-Old

A simple guide to ML-KEM, the new way two computers share a secret code that quantum computers cannot steal, explained with padlocks, locked boxes, and a clever double-check.

2026, Jul 03   — 

How Computers Sign Messages That Even a Quantum Computer Cannot Fake — Explained for a 10-Year-Old

A simple guide to ML-DSA, the new signature that quantum computers cannot fake, explained with everyday analogies about wax seals, secret paint, and drawings that must stay inside the lines.

2026, Jul 03   — 

SLH-DSA — The Stateless Hash-Based Signature Standard (FIPS 205)

How SLH-DSA (FIPS 205) builds a stateless post-quantum signature from hash functions alone, layering WOTS+, XMSS, a hypertree, and FORS, with the twelve parameter sets and the small/fast trade-off.

2026, Jun 29   — 

ML-KEM — The Module-Lattice Key-Encapsulation Standard (FIPS 203)

How ML-KEM (FIPS 203) builds a post-quantum key-encapsulation mechanism from module lattices, the K-PKE component, the Fujisaki-Okamoto transform with implicit rejection, and the three parameter sets.

2026, Jun 29   — 

ML-DSA — The Module-Lattice Digital Signature Standard (FIPS 204)

How ML-DSA (FIPS 204) builds a post-quantum digital signature from module lattices, the Fiat-Shamir with Aborts construction, rejection sampling, and the three NIST parameter sets.

2026, Jun 29   — 

The Chinese Remainder Theorem and its Cryptographic Applications

How the Chinese Remainder Theorem works, why it defines a ring isomorphism, and how it accelerates RSA signatures and explains square roots modulo a composite.

2026, Jun 28   — 

Zero-Knowledge Proof Vulnerabilities — A Technical Classification of Soundness, Completeness, and Protocol Failures

A technical classification of zero-knowledge proof vulnerabilities covering trusted setup failures, Fiat-Shamir binding errors, under-constrained witnesses, verification bypasses, field arithmetic wraparound and protocol boundary gaps.

2026, Jun 19   — 

How Zero-Knowledge Proofs Get Hacked — Explained for a 10-Year-Old

A simple guide to the main ways zero-knowledge proof systems have been broken, explained with everyday analogies about magic locks, bakers, and inspectors.

2026, Jun 19   — 

Halo — Recursive Proof Composition without a Trusted Setup

A technical introduction to Halo by Bowe, Grigg and Hopwood. Covers incrementally verifiable computation, amortized polynomial commitments, nested amortization, the Sonic-based main argument, and the Tweedledum/Tweedledee curve cycle.

2026, Jun 19   — 

Halo — How to Check an Endless Chain of Work with a Single Glance

An intuitive guide to Halo, the first system that lets you verify a million steps of computation by checking just one small proof, without trusting any secret setup ceremony.

2026, Jun 19   — 

The GKR Protocol — Delegating Computation with Interactive Proofs

A technical introduction to the GKR protocol by Goldwasser, Kalai and Rothblum. Covers layered arithmetic circuits, the sum-check protocol, multilinear extensions, and the recursive reduction used to build efficient interactive proofs.

2026, Jun 19   — 

The GKR Protocol — How to Check a Million Calculations Without Doing Them

An intuitive guide to the GKR protocol through everyday analogies. Learn how a verifier can check a massive computation by asking a few clever questions, without re-running a single step.

2026, Jun 19   — 

Canton Network — Architecture, Privacy Model, and Comparison with Ethereum, Railgun, Zcash, Zama fhEVM, and Besu

Canton Network is a privacy-preserving Layer-1 blockchain using Daml smart contracts and two-layer consensus. Learn its architecture, privacy model, and how it compares to Ethereum, Railgun, Zcash, Zama fhEVM, and Besu.

2026, May 12   — 

Technical Analysis of the OpenZeppelin ERC-7984 Implementation

A deep technical analysis of the OpenZeppelin ERC-7984 Confidential Fungible Token implementation, covering the core accounting model, FHE-safe arithmetic, ACL access patterns, operator system, and the extension ecosystem.

2026, Feb 24   — 

The Pedersen Commitment - Overview

Pedersen commitment provides a way to commit to a secret value while keeping it hidden, and ensures the value cannot be changed later.

2025, Nov 22   — 

Seal: Identity-Based Encryption for Onchain Access Control

Seal is a framework that allows developers to encrypt data using Identity-Based Encryption (IBE) while enforcing onchain access policies on Sui.

2025, Sep 27   — 

Understanding zk-SNARK: A Deep Dive into Zero-Knowledge Proofs

This article explains the cryptography behind zk-SNARKs and compares them to other zero-knowledge proofs like STARKs and Bulletproofs.

2025, Jul 29   — 

Blockchain wallets on AWS with Fireblocks and Circle

Deep dive into blockchain wallets with Circle and Fireblocks and explore how they use AWS services such as AWS Nitro Enclave

2025, Jul 29   — 

Poseidon Hash Function - Overview

The Poseidon hash function is a cryptographic hash function specifically designed for use in zero-knowledge proof systems like SNARKs and STARKs.

2025, May 27   — 

Lattice-Based Cryptography - The Short Integer Solution (SIS) Problem

Short integer solution (SIS)is an average-case problems used in lattice-based cryptography constructions. SIS is one of the problems believed to be hard even for quantum computers.

2025, Apr 23   — 

Bitcoin Keys 102: How Wallets Generate Seed Phrases and Private Keys

This article is a deep dive into the generation of private keys until obtaining a public address through the main related BIPs - BIP-32 and BIP-39

2025, Mar 27   — 

Chainlink DECO, zkTLS oracle

DECO is a zkTLS-oracle made by Chainlink for authenticating and verifying web data in a privacy-preserving manner.

2025, Jan 13   — 

Hardware Security - Understanding Fault Injection Attack

Fault injection attack (FIA) is a technique that targets the hardware itself to create unexpected behaviors in systems, sometimes with severe consequences.

2024, Dec 30   — 

Mutual TLS (mTLS) - Overview

Mutual TLS (mTLS) is an extension of the standard TLS protocol which requires both the client and server to present and validate certificates, enabling mutual authentication.

2024, Dec 16   — 

HMAC - Hash-Based Message Authentication Code

HMAC (Hash-Based Message Authentication Code) is a cryptographic algorithm used to ensure both integrity and authenticity of a message.

2024, Nov 27   — 

TLS 1.3 - Overview

Transport Layer Security (TLS) 1.3 is the latest version of the TLS protocol, designed to enhance internet security, speed, and privacy.

2024, Nov 04   — 

Differential Cryptanalysis - Targeting Hash Functions and Cryptographic Algorithms

Differential cryptanalysis is a method to attack symmetric cryptographic algorithms, such as block ciphers, by analyzing the impact of specific input differences on output differences after several rounds of encryption.

2024, Oct 30   — 

Introduction to Shamir’s Secret Sharing - How to share a secret

Shamir's Secret Sharing (SSS) is a cryptographic technique that allows to split a secret, such as a private key, into multiple shares distributed among trusted parties. Only a specified threshold of shares is required to reconstruct the secret, ensuring security against unauthorized access.

2024, Oct 29   — 

Bitcoin Keys 101 - From seed phrase to address

This article explains the generation of private keys in Bitcoin until obtaining a public address and the different type of addresses.

2024, Oct 28   — 

Overview of ECDSA - Elliptic Curve Digital Signature Algorithm

Learn how ECDSA (Elliptic Curve Digital Signature Algorithm) works, its role in digital signatures, and its different use cases, notably in Blockchain.

2024, Oct 23   — 

Overview, security and applications of Multi-Party Computation (MPC)

This article is an introduction to Multi-Party Computation (MPC)Mathematical Foundation of MPC

2024, Oct 21   — 

Trezor Crypto Wallet – Cryptography and Security

This article presents the different types of crypto wallets (hot, warm, cold) and their associated risks

2024, Oct 15   — 

Crypto Wallets Explained - Types, Risks, and How to select it

This article presents the different types of crypto wallets (hot, warm, cold) and their associated risks

2024, Oct 08   — 

Zero Knowledge Proofs with Bulletproof

Bulletproofs are efficient and compact zero-knowledge proofs. They're enhancing privacy and scalability in blockchain systems by reducing data size and verification time.

2024, Aug 13   — 

Main Concept Behind Zero-Knowledge Proof

This article is a summary of the main concepts behind Zero-Knowledge Proof (ZKP).

2024, Jun 17   — 

Overview of Zero-Knowledge development framework

Overview of the main development frameworks to build zero-knowledge system which Plonky2(Polygon), Halo2(Zcash), Boojum (Matter Labs),...

2024, Jun 10   — 

Winternitz One-Time Signature(OTS)

Presentation of Winternitz One-Time Signature (W-OST), a post quantum algorithm which relies on hash function (e.g SHA-256)

2024, May 30   — 

Pedersen Hash Function Overview

Presentation of the hash function Pedersen, which is efficient for zero-knowledge circuits (e.g. zk-SNARK)

2024, May 07   — 

Ethereum Staking - How It Works

Staking in Ethereum is a key functionality. This article explains the main concepts behind it - BLS signature, slashing, Withdrawal address,...

2024, Mar 28   — 

Deep dive into MetaMask Secrets

This article focuses on the different secrets available on Metamask, one of the most used crypto wallets.

2023, Jul 20   — 

Encrypt a USB key on Windows with Bitlocker

This article details how to encrypt a USB drive on Windows with Bitlocker, an encryption tool offered by Windows.

2022, Oct 06   — 

How to create a multisig wallet with Gnosis Safe

This tutorial present the different steps to create a multi signature wallet with Gnosis Safe on Ethereum.

2022, Aug 12   — 

Le protocole WEP et ses vulnérabilités

Cet article présente le protocole Wifi WEP (Wired Equivalent Privacy) en se focalisant sur les aspects sécuritaires (confidentialité, intégrité, authenticité).

2022, Apr 28   — 

Tester la résistance d'un crypto système à un niveau d'attaques

Cet article aborde les différents tests et jeux auxquels on peut soumettre un crypto système pour vérifier sa robustesse (p.ex. IND-CPA et IND-CAA).

2022, Apr 24   — 

Le mode opératoire GCM

Cet article présente le mode opératoire de chiffrement authentifié GCM avec une analyse sur sa sécurité (confidentialité, intégrité, authenticité et la génération d'IVs).

2022, Apr 22   — 

Chiffrement hybride sur les courbes elliptiques avec ECIES

Cet article présente le schéma de chiffrement intégré ECIES (Elliptic Curve Integrated Encryption Scheme) permettant de réaliser du chiffrement hybride.

2022, Apr 22   — 

Le mode opératoire ECB

Cet article présente le mode opératoire ECB avec une analyse sur sa sécurité (confidentialité, intégrité, authenticité).

2022, Apr 22   — 

Le mode opératoire CTR

Cet article présente le mode opératoire CTR avec une analyse sur sa sécurité (confidentialité, intégrité, authenticité et la génération d'IV).

2022, Apr 22   — 

Le mode opératoire CBC

Cet article présente le mode d'opération CBC en analysant également sa sécurité (réutilisation d'IV, répétition de blocs).

2022, Feb 27   — 

Les Courbes Elliptiques avec SageMath

Cet article explique l'implémentation des courbes elliptiques avec la librairie SageMath, par exemple la définition et l'addition des points sur une courbe.

2022, Feb 27   — 

Diffie-Hellman expliqué en python

Présentation du protocole de mise au point de clé Diffie-Hellman (key-agreement protocol) avec un exemple d'implémentation pour mieux comprendre les principes.

2021, Oct 28   — 

Analyser un message chiffré [transposition/substitution]

Cet article présente les manières d'analyser un message dont on ne connait pas la méthode de chiffrement employé. Il se concentre sur les chiffrements classiques ":" substitution mono-alphabétique (César, Vigenère) et la transposition comme le chiffre de RailFence.

2021, Aug 09   — 

Le Logarithme Discret sur courbe elliptique avec SageMath

Cet article traite du problème du logarithme discret sur une courbe elliptique. Il contient un exemple faisant appel à la librairie python SageMath.

2021, Jul 30   — 

Chiffrement RSA avec SageMath

Cet article explique comment implémenter le chiffrement RSA avec SageMath, logiciel permettant d'effectuer des opérations mathématiques utiles en cryptographie.

2021, Jul 27   —