Weird Machines in Transport Layer Security

A paper extending "weird machine" theory — the study of latent computation that emerges from the composition of architectural components — to a new domain: the Transport Layer Security (TLS) handshake and its two dominant implementations, OpenSSL and BoringSSL. Prior work had studied weird machines in software (x86 instructions, ELF metadata, page tables) and cyber-physical systems (industrial control networks); this paper argues the same phenomenon lives in a cryptographic protocol.

The central claim: legitimate TLS primitives — session cache entries, renegotiation logic, extension parsing, and certificate verification steps — compose into Turing-complete systems. Crucially, their computation is coupled not to physical actuation (as in industrial control) but to authentication and trust decisions. The authors formalize this coupling under the name trust actuation, and argue that any TLS implementation providing session storage, arithmetic on sequence counters, conditional branching on handshake state, and iteration through resumption or retry loops satisfies the conditions for arbitrary computation.

The theory is validated with two working demonstrations built on real OpenSSL code paths. The first, a sentinel system, composes standard TLS primitives into a defensive mechanism that detects anomalous handshake behavior. The second, an authentication bypass, composes the same class of primitives into an attack that defeats a cipher-strength policy check through mid-connection renegotiation — without any memory corruption or external malware. Both run against real server and client binaries in Docker.

As ingested, this is the abstract only: no proofs, code, or peer review are visible. The "Turing-complete" and "authentication bypass" claims are therefore unverified at the level of detail available here.