Fabio F. G. Buono

Low Kolmogorov complexity doesn't guarantee efficient expansion, revealing a critical flaw in cryptographic protocols that rely on compact representations.

Syntactic separation not only guarantees computational indistinguishability but also reveals new, exponential lower bounds on derivation lengths that challenge existing paradigms in cryptography and complexity theory.

Observational blindness and computational hardness are shown to be independent, challenging long-held assumptions in cryptographic frameworks.

Rejection sampling can eliminate bias in mixed-radix key generation, ensuring perfect secrecy from quantum key distribution sources.

The Syntactic Invariance Principle reveals that some mathematical truths are fundamentally tied to numerical properties, not just symbolic manipulation, with implications for understanding computational limitations in P versus NP.

Mixed-Radix One-Time Pad achieves perfect secrecy across non-uniform bases, challenging conventional assumptions about key entropy in cryptography.