Non-deterministic secure active element machine

Abstract

Based upon Turing incomputability, connectedness and properties of the active element machine (AEM), a malware-resistant computing machine is constructed. The active element computing machine is a non-Turing, non-register machine. AEM programs are designed so that the purpose of the AEM computations are difficult to apprehend by an adversary and hijack with malware. These methods can also be used to help thwart reverse engineering of proprietary algorithms, hardware design and other areas of intellectual property. Using quantum randomness, the AEM can deterministically execute a universal Turing machine (universal digital computer program) with active element firing patterns that are Turing incomputable. In an embodiment, a more powerful computational procedure is created than Turing's computational procedure (equivalent to a digital computer procedure). Current digital computer algorithms and procedures can be derived or designed with a Turing machine computational procedure. A novel computer is invented so that a program's execution is difficult to apprehend.

Description

RELATED APPLICATIONS[0001]This application claims priority benefit of U.S. Provisional Patent Application Ser. No. 61 / 462,260, entitled “Navajo Active Element Machine” filed Jan. 31, 2011, which is incorporated herein by reference; this application claims priority benefit of U.S. Provisional Patent Application Ser. No. 61 / 465,084, entitled “Unhackable Active Element Machine” filed Mar. 14, 2011, which is incorporated herein by reference; this application claims priority benefit of U.S. Provisional Patent Application Ser. No. 61 / 571,822, entitled “Unhackable Active Element Machine Using Randomness” filed Jul. 6, 2011, which is incorporated herein by reference; this application claims priority benefit of U.S. Provisional Patent Application Ser. No. 61 / 572,607, entitled “Unhackable Active Element Machine Unpredictable Firing Interpretations” filed Jul. 18, 2011, which is incorporated herein by reference; this application claims priority benefit of U.S. Provisional Patent Application Se...

AI Technical Summary

Benefits of technology

[0061]B. Meta commands and the use of time enable the AEM to change its program as it executes, which makes the machine inherently self-modifying. In the AEM, self-modification of the connection topology and other parameters can occur during a normal run of the machine when solving computing problems. Traditional multi-element machines change their architecture only during training phases, e.g. when training neural networks or when evolving structures in genetic programming. The fact that self-modification happens during runtime is an important aspect for cybersecurity of the AEM. Constantly changing systems can be designed that are difficult to reverse engineer or to disable in an attack. When the AEM has enough redundancy and random behavior when self-modifying, multiple instances of an AEM—even if built for the same type of computing problems—all look different from the inside. As a result, machine learning capabilities are built right into the machine architecture. The self-modifying behavior also enables AEM programs to be designed that can repair themselves if they are sabotaged.

[0075]In some embodiments, an AEM can execute on current computer hardware and in some embodiments is augmented. These novel methods using an AEM are resistant to hackers and malware apprehending the purpose of AEM program's computations and in terms of sabotaging the AEM program's purpose; sabotaging a computation's purpose is analogous to a denial of service or distributed denial of service attack. The machine has computing performance that is orders of magnitude faster when implemented with hardware that is specifically designed for AEM computation. The AEM is useful in applications where reliability, security and performance are of high importance: protecting and reliably executing the Domain Name Servers, securing and running critical infrastructure such as the electrical grid, oil refineries, pipelines, irrigation systems, financial exchanges, financial institutions and the cybersecurity system that coordinates activities inside institutions such as the government.BRIEF SUMMARY OF PRIOR ART COMPUTING MODELS

Problems solved by technology

AEM programs are designed so that the purpose of the AEM computations are difficult to apprehend by an adversary and hijack with malware.

The prior art has not been successful at securing computers, networks and the Internet.

Operating system weaknesses and the proliferation of mobile devices and Internet connectivity have enabled malware to circumvent these boundaries.

In the future, these approaches may be compromised by more advanced methods such as Shor's algorithm, executing on a quantum computing machine.

If the encrypted execution is tampered with (changed), then this destroys the computation even though the adversary may be unable to decrypt it.

Homomorphic cryptography executing on a register machine along with the rest of the prior art is still susceptible to fundamental register machine weaknesses discussed below.

The register machine model creates a security vulnerability because its computing steps are disconnected.

This topological property (disconnected) creates a fundamental mathematical weakness in the register machine so that register machine programs may be hijacked by malware.

It is our thesis that this insightful observation is a symptom of fundamental security weakness(es) in digital computer programs (prior art of register machines): It still takes about the same number of lines of malware code to hijack digital computer's program regardless of the program's size.

The sequential execution of single instructions in the register and von-Neumann machine make the digital computer susceptible to hijacking and sabotage.

Furthermore, once the digital computer program has been hijacked, if there is a friendly routine to check if the program is behaving properly, this safeguard routine will never get executed.

As a consequence, the sequential execution of single instructions cripples the register machine program from defending and repairing itself.

As an example of this fundamental security weakness of a digital computer, while some malware may have difficulty decrypting the computations of a homomorphic encryption operation, the malware can still hijack a register machine program computing homomorphic encryption operations and disable the program.

Furthermore, these rules change unpredictably because the AEM program interpretation can be based on randomness and in some embodiments uses quantum randomness.

The changing the rules property of the AEM programs with randomness makes it difficult for malware to apprehend the purpose of an AEM program.

Constantly changing systems can be designed that are difficult to reverse engineer or to disable in an attack.

Incomputability means that a general Turing machine algorithm can not unlock or solve an incomputable problem.

This means that a digital computer program can not solve an incomputable problem.

This means that prior art methods and their lack of solutions for malware that depend on Turing's halting problem and undecidability no longer apply to the AEM in this context.

This demonstrates the machine's predictable computing behavior which creates weaknesses and attack points for malware to exploit.

This non-Turing computing behavior generates random AEM firing interpretations that are difficult for malware to comprehend.

Images