Because mathematics is infinite, the field of cybersecurity can never be truly closed. The space of vulnerabilities is unbounded, each patch or solution only ever an approximation against the open horizon of possible attacks. Risk is permanent, not as a flaw but as a structural consequence: a system that protects itself must also endlessly expose […]
Context: The Puzzling Search for Perfect Randomness I can never resist a good speculative and completely “out there” waffle. Randomness is non-trivially significant in cryptography. The closer the approximation of a numerical sequence or the properties of an abstract geometrical object to randomness, the more difficult the encryption seed derived from it is to crack. […]
Some truths are only known by inversion, by negation and through a proof by contradiction. Alan Turing’s proof of the undecidability of non-trivially complex algorithms, that is – the impossibility of analysis to arrive at certainty concerning whether a given computer program will terminate or continue forever, was just such a proof. Kurt Gödel’s proof […]
Daedelus Kite 