6 papers · 1 filter
A Non-Formulable Theorem: A Fundamental Limit of Finite Syntactic Systems and Its Consequences for Security and AI
Fabio F. G. Buono
For every coherent and sufficiently expressive finite syntactic system S, we prove the existence of at least one theorem that S cannot produce autonomously. The result is a metathe…
What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction
Fabio F. G. Buono
This paper develops a single method, find what an accepted result silently assumed, make it a variable, and prove what follows once it is dropped, and shows it keeps working across…
Witness Complexity of Short Descriptions: A Cryptographic Perspective
Fabio F. G. Buono
In cryptographic practice, where protocols impose strict time bounds, implementations demand predictable resource usage, and real-world systems require immediate verification for s…
The Observer World: A Cryptographic Extension of Impagliazzo's Five Worlds
Fabio F. G. Buono
Impagliazzo's five worlds classify computational assumptions along a single axis, the existence of cryptographic primitives. All five worlds implicitly assume that every party, inc…
From Bits to Mixed-Radix Keys: Horner Decomposition, Uniform Sampling, and the Information-Theoretic QKD Interface of the MR-OTP
Fabio F. G. Buono
The Mixed-Radix One-Time Pad (MR-OTP) extends the classical OTP to heterogeneous alphabets while preserving perfect secrecy. We provide a practical, bias-free method to convert raw…
New Ideas on a New Old Type of Cipher:The Mixed-Radix One-Time Pad
Fabio F. G. Buono
In a short 2012 preprint, an unconventional cipher was introduced, now in this note we take that representational core, formalize it, and use it as the basis for a clean generaliza…