Cryptography

Applied Cryptography

Foundations of Cryptography

Introduction to Cryptography with Coding Theory

Serious Cryptography

Cipher Maps: Total Functions as Trapdoor Approximations

Encrypted Search with Oblivious Bernoulli Types: Information-Theoretic Privacy through Controlled Approximation

Algebraic Cipher Types: A Functorial Framework for Secure Computation

Algebraic Hashing A Modern C++20 Library for Composable Hash Functions Version 2.0

Apertures: Coordinated Partial Evaluation for Distributed Computation

Cryptographic perfect hash functions: A theoretical analysis on space efficiency, time complexity, and entropy

PFC: Zero-Copy Data Compression Through Prefix-Free Codecs and Generic Programming

The Beautiful Deception: How 256 Bits Pretend to be Infinity

The Beautiful Deception: How 256 Bits Pretend to be Infinity

Cryptographic theory assumes random oracles with infinite output. We have 256 bits. This paper explores how we bridge that gap, and what it means that we can.

Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security

Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.

The Beautiful Deception: How 256 Bits Pretend to be Infinity

A Boolean Algebra Over Trapdoors

A Boolean algebra framework over trapdoors for cryptographic operations. Introduces a homomorphism from powerset Boolean algebra to n-bit strings via cryptographic hash functions, enabling secure computations with one-way properties.

Algebraic Hashing: Composable Hash Functions Through XOR

A C++ library for composable hash functions using algebraic structure over XOR, with template metaprogramming.

Time Series Analysis of Confidentiality Degradation in Encrypted Search Systems

Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

Estimating How Confidential Encrypted Searches Are Using Moving Average Bootstrap Method

IEEE Paper: Estimating Encrypted Search Confidentiality via Bootstrap

My first IEEE publication. Using bootstrap methods to estimate how many queries an adversary needs to break encrypted search.

Random Oracles in Python

Three Python approximations of a random oracle, each showing a different tradeoff between true randomness, determinism, and composability.

Encrypted Search - Enabling Standard Information Retrieval Techniques for Several New Secure Index Types While Preserving Confidentiality Against an Adversary With Access to Query Histories and Secure Index Contents

Encrypted Search - Enabling Standard Information Retrieval Techniques for Several New Secure Index Types While Preserving Confidentiality Against an Adversary With Access to Query Histories and Secure Index Contents