Answers are grounded in this paper and cite their sources.
Mathematical analysis demonstrates a key encapsulation mechanism using unknown positional number bases, highlighting a knapsack-based defense against brute-force cryptanalysis.
The observation that a positional numeral cannot internally specify its own base — the "silent radix" problem identified in §1.1 of the Ultrametric Foundation — is not merely a philosophical curiosity. It is a cryptographic primitive. We formalize this as **Silent Radix Encryption (SRE)**, a key encapsulation mechanism (KEM) where the shared secret is derived from the base-b interpretation of publicly transmitted decimal digits. Only a party who knows the secret base b can recover the correct key. Eve, seeing the same decimal digit string N, must solve a variant of the integer knapsack problem where the weights (bⁱ) are unknown: given N = ∑ dᵢ · 10ⁱ, find b such that K = ∑ dᵢ · bⁱ decodes the ciphertext correctly. For b ~ 2¹²⁸, brute force is infeasible. ---
No takes yet. Share an insight, caveat, or question.
Rowan Brad Quni-Gudzinas (2026) studied this question.