2024-09-09 | #cryptography #scheme
A polynomial commitment scheme allows a prover to commit to a polynomial and later prove evaluations of the polynomial at specific points, without revealing the full polynomial. It ensures that the prover cannot change the polynomial after committing, and the verifier can check the correctness of the evaluations with high efficiency.
2023-09-06 | #consensus #cryptography #distributed-systems
Sassafras is a novel consensus protocol designed to address the recurring fork-related challenges encountered in other lottery-based protocols.
The protocol aims to create a mapping between each epoch’s slots and the authorities set while ensuring that the identity of authorities assigned to the slots remains undisclosed until the slot is actively claimed during block production.
2023-08-23 | #cryptography #number-theory
$\newcommand{\Z}{\mathbb{Z}}$
A cyclic group $G$ is a type of algebraic structure in abstract algebra which definition is based on the concept of a group and group generators.
2023-08-06 | #cryptography #mathematics #zk-proof
Zero-Knowledge Proofs (ZKP) represent a fascinating and influential concept within the realm of cryptographic protocols.
At a glance, a ZKP enables one party to demonstrate the correctness of a statement to another party without revealing any details beside the validity of the claim itself.
2023-07-23 | #codes
Given a finite alphabet X a code for X is a function:
c: X → {0,1}*
We can extend the code to arbitrary strings with symbols in X as:
2023-07-22 | #codes #cryptography #entropy #information-theory
Entropy serves as a fundamental metric for quantifying the information produced by a data source. This concept, primarily developed and explored by Shannon around 1948, forms the cornerstone of information theory. This field underpins the development of modern techniques in error correction, data compression, and cryptographic systems.
2023-03-29 | #cryptography #probability
The birthday paradox is a surprising statistical phenomenon that shows how even in a small group, it’s very likely that two people share the same birthday.
In this blog post, we’ll explore the math behind the paradox and its practical applications in computer science and cryptography.
2023-03-29 | #cryptography #number-theory
Discrete logarithm is a fundamental concept in modern cryptography, with numerous applications in key exchange, digital signatures, and other cryptographic protocols.
This post explores the basics of discrete logarithm, some important cryptographic protocols derived from it and the most important attacks.
2023-01-16 | #cryptography #number-theory
Generating random primes and testing their primality is essential for many cryptographic algorithms. In this post, we’ll explore methods for generating and testing prime numbers.
We want to develop an algorithm that generates a prime in the range
[2ᵏ⁻¹, 2ᵏ-1], with k the number of bits required to represent the
prime.
2022-12-18 | #system #tooling
Discovering the right tools can significantly improve your productivity and user experience on any operating system. In this post, I’ll share some of my go-to tools that I personally use on my workstation to enhance my workflow.