cronokirby
Hello! I'm Lucas, sometimes known as
- Posts
- 112 from 6 Mar 2019 to 24 Jun 2026
- Posting
- now and then (3 in the last year)
- Kind
- personal blog
2026 3
2025 3
2023 12
- A Sketch of Synthetic Cryptography
- Cait-Sith Security (0): Preliminaries
- Cait-Sith Security
- Cait-Sith Security (4): Signing
- Cait-Sith Security (3): Multiplication and Triples
- Cait-Sith Security (X): Cheat Sheet
- Young Man Shouts at Computer
- Cait-Sith Security (2): Key Sharing
- Some Bits about Cait-Sith
- Cait-Sith Security (1): Echo Broadcast
- Some MPS Utilities
- Cryptography without Security
2022 27
- Notes on Chosen Generator Discrete Logarithms
- DKGs in Groups
- Notes on STARK Arithmetization
- On Adding Chaining to SAFE
- Simple Multi-Round Fiat-Shamir with BLAKE3
- Powers of Tau Proofs
- The Goldilocks Field
- On RAM In Structured Computation
- The Paper that Keeps Showing Up
- On Verifying Public Coin Protocols inside ZK Proofs
- Some KEMs and Some Proofs
- Basic Cryptography Without Fluff
- On Identifiable Aborts
- On Defining the One More Discrete Logarithm Problem
- State-Separable Proofs for the Curious Cryptographer
- Some Cryptography Books I Like
- Bit Flipping in State Separable Proofs
- Explaining Yao's Garbled Circuits
- Canetti et al's Paradoxical Encryption Scheme
- RSA Schnorr Signatures
- What I've Been Working On: 2022-W13
- Encoding Traits with Go Generics
- What I've Been Working On: 2022-W10
- On Monero's Ring Signatures
- Some More Notes on Formalizing Games
- On Formalizing Security Games
- On The Malleability of ECDSA Signatures
2021 26
- Porting Ludus to the Web
- My Quick Attempt at Bluesky's Satellite Challenge
- On Doerner et al's modifications to Extended Random OT
- Better Notation for Matrices
- Avalanche Signatures
- Taproot Signatures and BIP-32
- On Multi-Set Hashing
- Quantum Computing: Some Analogies
- Signatures From Identification Schemes
- Introducing Nuntius
- End-to-End Encryption in Web Apps
- Introducing Nimotsu
- Reflexive Interfaces in Go
- Making Go's RSA Internals Constant Time
- Montgomery Ladder in ECC
- Constant-Time Big Numbers: An Introduction
- Some Thoughts on Numeric Classes
- Fractals on The Web
- Spaced Repetition for Mathematics
- Programming Problem: Run-Length Encoding
- Tychonoff's Theorem and Zorn's Lemma
- Thoughts on Big Number APIs
- On Strings in Compilers
- Let's Describe Algorithms Better
- Nets define Topologies
- Making an IO
2020 31
- Discrete, Indiscrete: Free, CoFree
- (Basic) Universal Properties in Haskell
- (Haskell in Haskell) 3. Parsing
- Universal Properties and Adjunctions
- Misc 0
- Connectedness and Constant Maps
- Topological Groups are Hausdorff
- Chinese Remainder Theorem for Programmers
- (Haskell in Haskell) 2. Lexing
- (Un)fold as (Co)algebra
- A simple algorithm for UNIX's Tree
- (Haskell in Haskell) 1. Setup
- On Deep Immutability
- (Haskell in Haskell) 0. Introduction
- Always use offsetof
- Lexer Combinators
- Monty Hall and Counterfactuals
- My Blog: Version 4
- Categorical Graphs
- Wrapping GtkImContext
- Recursive Types as Initial Algebras
- Encoding the Naturals
- Empty vs NonEmpty Groups
- Monomorphisms vs Epimorphisms
- Simple WebRTC Video Chat
- Parsing A Whitespace-Sensitive Language
- What I like about Roam (so far)
- Against Fullstack Data Sharing
- Review: The New York Trilogy
- Integrating Notes and Spaced Repetition
- React Pitfalls: useState initialization