Non-deterministic secure active element machine

• US 10,268,843 B2
• Filed: 03/10/2015
• Issued: 04/23/2019
• Est. Priority Date: 12/06/2011
• Status: Active Grant

• Current Assignee: AEMEA, Inc.
• Original Assignee: AEMEA, Inc.
• Inventors: Fiske, Michael Stephen
• Primary Examiner(s): King, John B
• Application Number:
  US14/643,774
• Publication Number:
  US 20150186683A1
• Time in Patent Office: 1,505 Days
• CPC Class Codes: G06F 21/75 by inhibiting the analysis of circuitry or operation
• CPC Class Codes: G06F 9/448 Execution paradigms, e.g. implementations of programming paradigms

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.

Claims

1. A physical computing machine implemented method for performing computations comprising:

constructing, by the physical computing machine, a procedure, the procedure including a set of one or more machine instructions, which when invoked cause the machine to perform one or more tasks;

constructing, by the physical computing machine, a first method of a multiplicity of possible methods for performing a first instance of the procedure;

performing computations by implementing the first instance of the procedure by the first method on the physical computing machine, therein implementing the set of one or more machine instructions according to the first method;

constructing, by the physical computing machine, a second method of the multiplicity of possible methods for performing a second instance of the procedure; and

performing computations by implementing the second instance of the procedure by the second method on the physical computing machine, therein implementing the same set of one or more machine instructions according to the second method;

wherein the constructing of the first instance of the procedure on the physical computing machine and the constructing of the second instance of the procedure on the physical computing machine are based on a non-deterministic process running within the physical computing machine;

the first instance of the procedure performs an operation specified by the set of instructions and the second instance of the procedure also performs the operation specified by the set of one or more machine instructions, but

the first instance of the procedure performs the procedure by the first method, and therein performs the operation specified by the set of one or more machine instructions, via the first method, and

the second instance of the procedure performs the procedure, via the second method and therein performs the operation specified by the set of one or more machine instructions by the second method,

therein protecting security of the method by obscuring the operation performed by the procedure from a potential hacker;

wherein said non-deterministic process is generated from quantum events occurring on the physical computing machine.

2. The machine implemented method of claim 1 wherein said quantum events involve emission and detection of photons at a photodetector associated with the computing machine.

3. The machine implemented method of claim 2 wherein the computing machine, in association with the detection of the photons, determines arrival times of the photons at the photodetector, and the computing machine generates randomness in said non-deterministic process, based on the arrival times of the photons.

4. The method of claim 1, wherein base code of each of the multiplicity of methods is different from the base code of the others of the multiplicity of methods, and the base-code that is different each implements the procedure.

5. The method of claim 1, wherein microcode of each of the multiplicity of methods is different from the microcode of the others of the multiplicity of methods, and the microcode that is different each implements the procedure.

6. The method of claim 1, wherein

the first instance is a first instance of a universal machine that implements the procedure;

the second instance is a second instance of the universal machine that implements the procedure;

base code of each of the multiplicity of methods is different from the base code of the others of the multiplicity of methods, and the base-code that is different each implements the procedure;

the universal machine being programmable.

7. The method of claim 6, the universal machine is a universal Turing machine.

8. The method of claim 1, wherein base code of a given instruction of the procedure implemented by each of the multiplicity of methods is different from the base code of the given instruction of the procedure implemented by others of the multiplicity of methods, and the base-code that is different of each of the multiplicity of methods implements the procedure, so that results of the procedure are independent of the method of the multiplicity of methods chosen.

9. The method of claim 8, the base code of the given instruction being level set rules.

10. The method of claim 8, the level set rules being implemented in lieu of Boolean operations.

11. The method of claim 8, wherein the base code performs Boolean operations by implementing level set rules.

12. The method of claim 8, the base code being lower level code than the one or more machine instructions.

17. The machine implemented method of claim 1 wherein said procedure is implemented with a digital computer program and at least one of the program'"'"'s instructions is computed differently at distinct times, wherein computing of the at least one of the program'"'"'s instructions differently does not affect results of implementing the at least one of the program'"'"'s instructions.

18. The machine implemented method of claim 17 wherein said computer program instructions are expressed in one or more of the following languages:

C, JAVA, C++, Fortran, Ruby, LISP, Haskell, Python, assembly language, RISC machine instructions, java virtual machine, or prime directed edge sequences.

13. A physical computing machine implemented method for performing computations comprising:

constructing, by the physical computing machine, a procedure, the procedure including a set of one or more machine instructions, which when invoked cause the machine to perform one or more tasks;

constructing, by the physical computing machine, a first method of a multiplicity of possible methods for performing a first instance of the procedure;

performing computations by implementing the first instance of the procedure by the first method on the physical computing machine, therein implementing the set of one or more machine instructions according to the first method;

constructing, by the physical computing machine, a second method of the multiplicity of possible methods for performing a second instance of the procedure; and

performing computations by implementing the second instance of the procedure by the second method on the physical computing machine, therein implementing the same set of one or more machine instructions according to the second method;

wherein the constructing of the first instance of the procedure on the physical computing machine and the constructing of the second instance of the procedure on the physical computing machine are based on a non-deterministic process running within the physical computing machine;

the first instance of the procedure performs an operation specified by the set of instructions and the second instance of the procedure also perform the operation specified by the same the set of one or more machine instructions, but

the first instance of the procedure performs the procedure by the first method, and therein performs the operation specified by the set of one or more machine instructions, via the first method, and

the second instance of the procedure performs the procedure, via the second method and therein performs the operation specified by the set of one or more machine instructions by the second method,

therein protecting security of the method by obscuring the operation performed by the procedure from a potential hacker;

wherein said physical computing machine is comprised of a multiplicity of computing elements; and

a multiplicity of couplings communicatively connecting the multiplicity of computing elements to one another, such that the couplings are capable of transmitting messages between the multiplicity of computing elements;

the physical computing machine implemented method further including at least

constructing a group of connected computing elements;

constructing a group of sets of possible messages of a group of computing elements;

each set of messages of the group of sets being capable of computing the procedure;

the multiplicity of possible methods including a multiplicity of messages of the group of the connected computing elements, the multiplicity of messages computing the procedure;

selecting a first set of messages, the first set of messages performs the computations for the first instance of the procedure; and

selecting a second set of messages, the second set of messages performs the computations for a second instance of the procedure.

14. A machine implemented method for performing computations comprising:

constructing a procedure;

constructing a first method of a multiplicity of possible methods for a first instance of the procedure;

performing computations using the first instance of the procedure;

constructing a second method of the multiplicity of possible methods for computing a second instance of the procedure; and

performing computations using the second instance of the procedure;

wherein a non-deterministic process helps construct the first instance and second instances of the procedure;

wherein said machine includes at least a multiplicity of computing elements; and

a multiplicity of couplings communicatively connecting the multiplicity of computing elements to one another, such that the couplings are capable of transmitting messages between the multiplicity of computing elements;

constructing a group of connected computing elements;

constructing a group of sets of possible messages of a group of computing elements;

each set of messages of the group of sets being capable of computing the procedure;

the multiplicity of possible methods including a multiplicity of messages of the group of the connected computing elements, the multiplicity of messages computing the procedure;

selecting a first set of messages, the first set of messages performs the computations for the first instance of the procedure; and

selecting a second set of messages, the second set of messages performs the computations for a second instance of the procedure;

wherein said computing elements and couplings are implemented with an active element machine;

wherein said messages are firing patterns; and

wherein said non-deterministic process is generated from quantum events.

15. The machine implemented method of claim 14 wherein said active element machine uses quantum events to generate one or more said firing patterns.

16. The machine implemented method of claim 15 wherein said one or more firing patterns compute edge pattern substitution.

19. A system for performing computations including at least a programmed machine, the programmed machine being programmed to implement a method comprising:

constructing, by the programmed machine, a desired set of input/output pairs, the set including a number of input/output pairs, the set forming a procedure, wherein each input/output pair specifies at least output that results from processing the input of the input/output pair, and the procedure is a combination of one or more machine-implemented steps that are implemented as a result of invoking the set of input/output pairs;

selecting, by the programmed machine, one computation, as a first computation, from a multiplicity of possible computations for computing results of implementing the input/output pairs, where each of the multiplicity of computations produces results that are independent of which computation of the multiplicity of computations is selected and each computation computes results of implementing the input/output pairs, therein causing the machine to perform the steps of the procedure, the selecting of the first computation being based upon a non-deterministic process running within hardware associated with the programmed machine;

constructing, by the programmed machine, the first computation from the multiplicity of possible computations for computing results of implementing the input/output pairs, for a first instance of the procedure;

performing computations, by the programmed machine, based on the first instance of the procedure;

selecting another computation, as a second computation, from the multiplicity of possible computations for computing results of implementing the input/output pairs therein computing the procedure, the selecting of the second computation being based upon the non-deterministic process running within hardware associated with the programmed machine;

constructing, by the programmed machine, the second computation of the multiplicity of possible computations for computing results of implementing the input/output pairs, for a second instance of the procedure; and

performing, by the programmed machine, computations based on the second instance of the procedure;

wherein said non-deterministic process is generated from quantum events.

20. The system of claim 19, comprised of a multiplicity of computing elements;

and a multiplicity of couplings communicatively connecting the multiplicity of computing elements to one another, such that the couplings are capable of transmitting messages between the multiplicity of computing elements;

where constructing a computation of the multiplicity of possible computations for computing results of implementing the input/output pairs, includes at least

constructing a group of connected computing elements for computing the desired set of input/output pairs, each computing element being capable of sending and receiving messages, and

constructing a group of sets of possible messages from a group of computing elements;

each set of messages of the group of sets of possible messages, as a result of being received by computing elements of the multiplicity of computer elements, being capable of computing the desired set of input/output pairs;

the multiplicity of possible computations including a multiplicity of messages of the group of the connected computing elements, the multiplicity of messages, as a result of being received by computing elements of the multiplicity of computer elements, causing a computing of the desired set of input/output pairs;

selecting a first set of messages, the first set of messages, as a result of being received by computing elements of the multiplicity of computer elements, causing a performance of the computations for the first instance of the procedure; and

selecting a second set of messages, the second set of messages, as a result of being received by computing elements of the multiplicity of computer elements, causing a performance of the computations for the second instance of the procedure.

21. The system of claim 19, the system further comprising a photodetector, wherein said quantum events involve emission and detection of photons with the detector.

22. The system of claim 21 wherein said detection uses the arrival times of photons to generate randomness in said non-deterministic process.

23. The system of claim 19 wherein said procedure is implemented with a digital computer program and at least one of the program'"'"'s instructions is computed differently at distinct times, the at least one of the program'"'"'s instructions producing deterministic results at each of the distinct times.

24. The system of claim 23 wherein said computer program instructions are expressed in one or more of the following languages:

C, JAVA, C++, Fortran, Ruby, LISP, Haskell, Python, assembly language, RISC machine instructions, java virtual machine, or prime directed edge sequences.

25. A system for performing computations comprising:

constructing a desired set of input/output pairs, the set including a number of input/output pairs, the set forming a procedure;

constructing a first computation from the multiplicity of possible computations for computing the input/output pairs, for a first instance of the procedure;

performing computations using the first instance of the procedure;

constructing a second computation of the multiplicity of possible computations for computing the input/output pairs, for a second instance of the procedure; and

performing computations using the second instance of the procedure;

wherein a non-deterministic process helps select the first and the second computations;

a multiplicity of computing elements; and

a multiplicity of couplings communicatively connecting the multiplicity of computing elements to one another, such that the couplings are capable of transmitting messages between the multiplicity of computing elements;

the constructing of the multiplicity of computations of computing the input/output pairs, including at least

constructing a group of connected computing elements for computing the desired set of input/output pairs, each computing element being capable of sending and receiving messages, and

constructing a group of sets of possible messages from a group of computing elements;

each set of messages of the group of sets being capable of computing the desired set of input/output pairs;

the multiplicity of possible computations including a multiplicity of messages of the group of the connected computing elements, the multiplicity of messages computing the desired set of input/output sets;

selecting a first set of messages, the first set of messages performs the computations for the first instance of the procedure; and

selecting a second set of messages, the second set of firing messages performs the computations for a second instance of the procedure;

wherein said computing elements and couplings are implemented with an active element machine;

wherein said messages are firing patterns; and

wherein said non-deterministic process is generated from quantum events.

26. The system of claim 25 wherein said active element machine uses quantum events to generate from one or more firing patterns.

27. The system of claim 26 wherein said one or more firing patterns compute edge pattern substitution.

28. A physical computing machine implemented method for performing computations comprising:

constructing, by the physical computing machine, a procedure;

constructing, by the physical computing machine, a first method of a multiplicity of possible methods for a first instance of the procedure;

performing computations by implementing the first instance of the procedure on the physical computing machine;

constructing, by the physical computing machine, a second method of the multiplicity of possible methods for computing a second instance of the procedure; and

performing computations by implementing the second instance of the procedure on the physical computing machine;

wherein the constructing of the first instance of the procedure on the physical computing machine and the constructing of the second instance of the procedure on the physical computing machine are based on a non-deterministic process running within the physical computing machine;

the first instance of the procedure performs an operation specified by the set of instructions and the second instance of the procedure also perform the operation, but the first instance of the procedure performs the operation, via the first method, and the second instance of the procedure performs the procedure, via the second method, therein protecting security of the method by obscuring the operation performed by the procedure from a potential hacker

wherein

the first instance is a first instance of a universal machine that implements the procedure;

the second instance is a second instance of the universal machine that implements the procedure;

base code of each of the multiplicity of methods is different from the base code of the others of the multiplicity of methods, and the base-code that is different each implement the procedure, the universal machine is a universal Turing machine, and the base code is active element machine code.

29. A physical computing machine implemented method for performing computations comprising:

constructing, by the physical computing machine, a procedure;

constructing, by the physical computing machine, a first method of a multiplicity of possible methods for a first instance of the procedure;

performing computations by implementing the first instance of the procedure on the physical computing machine;

constructing, by the physical computing machine, a second method of the multiplicity of possible methods for computing a second instance of the procedure; and

performing computations by implementing the second instance of the procedure on the physical computing machine;

wherein the constructing of the first instance of the procedure on the physical computing machine and the constructing of the second instance of the procedure on the physical computing machine are based on a non-deterministic process running within the physical computing machine;

the first instance of the procedure and the second instance of the procedure perform the same operation, but the first instance of the procedure performs the operation, via the first method, and the second instance of the procedure performs the procedure, via the second method, therein protecting security of the method by obscuring the operation performed by the procedure from a potential hacker,

wherein

the first instance is a first instance of a universal machine that implements the procedure;

the second instance is a second instance of the universal machine that implements the procedure;

base code of each of the multiplicity of methods is different from the base code of the others of the multiplicity of methods, and the base-code that is different each implement the procedure,

the based code is active element machine code.