Entropy Maps
Entropy maps use prefix-free hash codes to approximate functions without storing the domain, achieving information-theoretic space bounds with controllable error.
1
of 6
← All Series
Trapdoor-Computing
Posts in this Series
Showing 6 of 6 posts
2
of 6
Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security
Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.
3
of 6
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.
4
of 6
Algebraic Hashing: Composable Hash Functions Through XOR
A C++ library for composable hash functions using algebraic structure over XOR, with template metaprogramming.
5
of 6
Rank-Ordered Encrypted Search
Rank-ordered search over encrypted documents using oblivious entropy maps, enabling relevance scoring without revealing document contents.
6
of 6
Random Oracles in Python
Three Python approximations of a random oracle, each showing a different tradeoff between true randomness, determinism, and composability.