#Cryptography
7 posts in tag “Cryptography”.
TLS, PKI, and Secure Protocols: How Encrypted Web Traffic Works
2025-11-18A deep technical guide to TLS, certificate validation, key exchange, record protection, modern cipher suites, TLS 1.3, QUIC, and practical deployment best practices for secure networked applications.
Lattice-Based Cryptography: Learning With Errors and the Road to Fully Homomorphic Encryption
2025-08-24Enter the post-quantum world of lattice-based cryptography: the Learning With Errors (LWE) problem, its reduction from worst-case lattice problems, the construction of basic encryption from LWE, and the stunning breakthrough of fully homomorphic encryption that computes on encrypted data.
Zero-Knowledge Proofs: From Interactive Protocols to zk-SNARKs and Practical Verifiable Computation
2025-04-24Build zero-knowledge proofs from the ground up: the simulation paradigm, Schnorr's protocol for discrete log, the transformation to non-interactive via Fiat-Shamir, and the engineering of modern zk-SNARKs for verifiable computation.
Countdown to Quantum: Migrating an Enterprise to Post-Quantum Cryptography
2024-01-29Practical lessons from a multi-year effort to adopt quantum-safe cryptography without breaking production.
Format-Preserving Encryption: The FFX Mode, Rank-Encipher-Unrank, and Legacy Database Protection
2023-02-25A technical deep dive into FPE: the Feistel-based FFX mode with AES, the rank-encipher-unrank construction, and practical applications in encrypting legacy databases and tokenization systems without breaking schemas.
Algebraic Geometry in Computer Science: Gröbner Bases, the Nullstellensatz, and Applications in Cryptography and Coding Theory
2022-08-21A rigorous exploration of how algebraic geometry—Gröbner bases, Hilbert's Nullstellensatz, and elliptic curves—powers modern cryptography, error-correcting codes, and complexity theory.
Average-Case Complexity: Levin's Distributional Problems, AvgP, and Cryptographic Implications
2019-10-20A deep examination of average-case complexity—Levin's theory of distributional NP-completeness, the class AvgP, and why cryptography needs hard-on-average problems.