Explores hiding cryptographic keys in card permutations, covering ranking/unranking algorithms and SymPy implementation.
Explores quadratic residues modulo primes, focusing on low squares and a unique signature property for primes congruent to 3 mod 4.
Explains what passkeys are, how they use asymmetric cryptography, and why they are more secure than passwords.
Explains the Schwartz-Zippel lemma for testing polynomial identities via random sampling, with applications in cryptography and zero-knowledge proofs.
Explains how to reverse engineer the internal state of the xorshift128 random number generator using its outputs.
A cryptography engineer discusses recent quantum computing breakthroughs and the urgent need for quantum-resistant cryptography.
Explores the parallels between Y2K preparation and the need for post-quantum cryptography, warning of financial collapse if unprepared.
Explains an algorithm for finding a non-square modulo a prime, with Python code and examples from cryptography.
Explains a zero-knowledge proof for verifying a product without revealing the numbers, using elliptic curves and pairings.
Explains how to construct a zero-knowledge proof to demonstrate knowledge of a discrete logarithm without revealing the secret value.
.NET 10 introduces built-in Post-Quantum Cryptography (PQC) APIs, enabling developers to adopt quantum-resistant algorithms for future security.
Explains Montgomery's trick for efficiently computing multiple modular inverses at once, with Python code examples and performance comparison.
Explores prime number chains like Cunningham chains and their application in the Primecoin cryptocurrency's proof-of-work system.
A simple, intuitive explanation of public key cryptography using analogies and a number game to explain how to prove a secret without revealing it.
LLVM 21 adds constant-time support to protect cryptographic code from timing attacks at the compiler level.
A summary of key developments in Go's cryptography ecosystem over the past year, including post-quantum key exchanges and security improvements.
A developer uses Claude Code to debug a complex bug in their Go implementation of the ML-DSA post-quantum cryptography algorithm.
A technical guide on generating private and public keys for the Nostr protocol locally using openssl and Secp256k1.
Geomys, a professional open source maintainer group, discusses taking over critical but unmaintained Go projects like bluemonday and gorilla/csrf as a 'maintainer of last resort'.
Overview of Himitsu 0.9, a secret storage manager for Linux, covering its new GTK4 prompter and Secret Service API integration.
