Fiske Software LLC

Biogy, Inc.

Aemea Inc.

Other

Vysk Communications, Inc.

Bionopoly LLC

Michael Stephen Fiske

Jon Louis

Waleed Sami Haddad

Victor E Cocchia

Alexander Paul Barangan

Methods and systems described herein authenticate a user and help secure transaction. A display screen presents images that are difficult for malware to recognize but a person can recognize. In at least one embodiment, a person communicates transaction information using visual images received from the service provider system. In at least one embodiment, a user selects a sequence of visual images as a means of authenticating the user and logging into a financial account or other corporate account. In some embodiments, methods and systems are provided for determining whether to grant access, by generating and displaying visual images on a screen that the user can recognize, and select. In an embodiment, a user presses his or her finger or fingers on a display screen to select images as a method for authenticating and protecting communication from malware. In an embodiment, non-determinism in hardware helps unpredictably vary the image selected, the image location, generate noise in the image, or change the shape or texture of the image. In some embodiments, visual image authentication helps Alice and Bob detect if Eve has launched a man-in-the-middle attack on their key exchange.

Visual image authentication

This invention pertains to secure communications between multiple parties and/or secure computation or data transmission between multiple computers or multiple vehicles. This invention provides a secure method for three or more parties to establish one or more shared secrets between all parties. In some embodiments, there are less than 40 parties and in other embodiments there are more than 1 million parties that establish a shared secret. In some embodiments, establishing a shared secret among multiple parties provides a method for a secure conference call. In some embodiments, a shared secret is established with multiple computer nodes across the whole earth to help provide a secure Internet infrastructure that can reliably and securely route Internet traffic. In some embodiments, a shared secret is established so that self-driving vehicles may securely communicate and securely coordinate their motion to avoid collisions. In some embodiments, a shared secret is established with multiple computer nodes that participate as a network, performing blockchain computations.

Multiparty key exchange

We describe a computing machine (ex-machine) that uses self-modification and randomness to enhance computation. An ex-machine program can compute languages that a standard machine cannot compute. An ex-machine has three types of instructions: standard, meta and random. One or more meta instructions self-modify the machine as it executes. Sometimes standard instructions are expressed in the C programming language or a hardware description language (VHDL). In an embodiment, random instructions take measurements from a random source that measures quantum events. In an embodiment, an ex-machine receives a computer program as input, containing only standard instructions. An ex-machine can combines random instructions and meta instructions to self-modify its instructions, so that it can evolve to compute (verify) the correctness of the computer program that it received as input. In an embodiment, an ex-machine uses its meta and random instructions to improve its machine learning procedures as the ex-machine is computing.

Quantum random self-modifiable computer

Our machine architecture and machine procedures use robustness, unpredictably and variability to hinder malware infection. In some embodiments, our machine instruction opcodes are randomized. The computing behavior of our machine is structurally stable (invariant) to small changes made to its machine instructions. Our invention expands the engineering method of stability to a cryptographically stable machine that is resistant to malware sabotage by an adversary. Our procedures use quantum randomness to build unpredictable stable instructions. Our machine procedures can execute just before running a program so that the computing task can be performed with a different representation of its instructions during each run. A process of hiding a key or data inside of random noise is described that protects the privacy of the machine instruction opcodes and operands. In some embodiments, quantum randomness generates random noise, using photonic emission with a light emitting diode.

Hiding stable machine instructions in noise

A new computational machine is invented, called a clock machine, that is a novel alternative to computing machines (digital computers) based on logic gates. In an embodiment, computation is performed with one or more clock machines that use time, and can perform any Boolean function. In an embodiment, a cryptographic cipher is implemented with random clock machines, constructed from a non-deterministic process, wherein the compiled set of instructions (i.e., the implementation of the cryptographic procedure) is distinct on each device or chip that executes the cryptographic cipher. In an embodiment, by using a different set of clock machines to execute two different instances of the same cryptographic procedure, each execution of a procedure looks different to malware that may try to infect and subvert the cryptographic procedure. This cryptographic process helps hinder timing attacks. In an embodiment, a detailed implementation of the Midori cipher with random clock machines is described.

Clock and periodic computing machines

Based upon the principles of randomness and self-modification a novel computing machine is constructed. This computing machine executes computations, so that it is 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 in the random instructions and self-modification in the meta instructions, creates computations that are incomputable by a digital computer. In an embodiment, a more powerful computational procedure is created than a computational procedure equivalent to a digital computer procedure. Current digital computer algorithms and procedures can be constructed or designed with ex-machine programs, that are specified by standard instructions, random instructions and meta instructions. A novel computer is invented so that a program's execution is difficult to apprehend.

Secure non-deterministic, self-modifiable computing machine

A symmetric cryptography for encrypting and decrypting information is provided, that can be implemented efficiently in hardware or in software. The symmetric cryptography uses a key generator, so that the cryptography is not dependent on a single, static cryptography key. The key generator is a value or collection of values from which the key is generated. In some embodiments, the key generator substantially increases the computational complexity of differential cryptanalysis and other cryptographic attacks because it has more entropy than the key(s). In an embodiment, the key generator is updated with one-way functions exhibiting the avalanche effect, which generates an unpredictable sequence of keys used during the encryption or decryption process. In an embodiment, a dynamic key is derived from a key generator with a one-way function. In an embodiment, a block cipher uses a different dynamic key to encrypt each block of plaintext, where each key is derived from a different key generator.

NADO cryptography with key generators

Methods and systems are provided for performing a secure transaction. In an embodiment, users register biometric and/or other identifying user information. A private encryption key is generated from the biometric information and/or other user information and/or information obtained from a unpredictable physical process and are stored in a secure area of a device and a public key is transmitted to the blockchain network which acts as a service provider. In some embodiments, the execution and integrity of transactions by using transaction signatures, based on visual images is disclosed. In an embodiment, a blockchain network verifies and executes the transaction.

Securing transactions with a blockchain network

This invention pertains to protecting communications between multiple sensors and emitters or securing data transmission between multiple computers or multiple vehicles. This invention provides a secure method for two or more parties to communicate privately, even when the processor has malicious malware or there is a backdoor in the main processor. In some embodiments, the energy received by the sensor is encrypted before it undergoes an analog to digital conversion. In some embodiments, the encryption occurs inside the sensor. In some embodiments, the encryption hardware is a part of the sensor and creates unpredictable energy changes that interact with the sensor. In some embodiments, there are less than 40 sensors in a communication system and in other embodiments there are more than 1 billion sensors. In some embodiments, the invention provides a method for the sensors of a network of self-driving cars to communicate securely.

Protecting sensors and emitters

We describe a computing machine, called a quantum random, self-modifiable computer, that uses self-modification and randomness to enhance the computating power. Sometimes it is called an ex-machine, derived from the latin extra machinam because its can evolve as it computes so that its complexity increases without an upper bound. In an embodiment, an ex-machine program can compute languages that a Turing or standard machine cannot compute. In an embodiment, the ex-machine has three types of instructions: standard instructions, meta instructions and random instructions. In an embodiment, the meta instruction self-modify the machine as it is executing so that new instructions are added. In an embodiment, the standard instructions are expressed in the C programming language or a hardware description language such as VHDL. Random instructions take random measurements from a random source. In an embodiment, the random source produces quantum events which are measured during the machine's execution. In an embodiment, an ex-machine receives a computer program as input, containing only standard instructions. In an embodiment, the ex-machine combines its random instructions and its meta instructions to self-modify the ex-machine instructions, so that it can evolve to compute (i.e., verify) the correctness of the computer program that it received as input. In an embodiment, an ex-machine uses its meta instructions and random instructions to improve its machine learning procedures as the ex-machine is computing. In an embodiment, machine computation that adds randomness and self-modification to the standard digital computer instructions has more computing capability than a standard digital computer. This capability enables more advanced machine learning procedures where in some embodiments meta instructions and random instructions improve the machine learning procedure, as it is executing. In an embodiment, differential forms, the curvature tensor, and curvature of saddle points are used to help self-modify and improve an initial, standard gradient descent method.

Quantum random, self-modifiable computer

We describe a computing machine, called an ex-machine, that uses self-modification and randomness to enhance the computation. The name ex-machine is derived from the latin extra machinam because its can evolve as it computes so that its complexity increases without an upper bound. In an embodiment, an ex-machine program can compute languages that a Turing or standard machine cannot compute. In an embodiment, the ex-machine has three types of instructions: standard instructions, meta instructions and random instructions. In an embodiment, the meta instruction self-modify the machine as it is executing so that new instructions are added. In an embodiment, the standard instructions are expressed in the C programming language or VHDL dataflow language. Random instructions take random measurements from a random source. In an embodiment, the random source produces quantum events which are measured. In an embodiment, an ex-machine receives a computer program as input, containing only standard instructions. In an embodiment, the ex-machine combines its random instructions and its meta instructions to self-modify the ex-machine instructions, so that it can evolve to compute (i.e., verify) the correctness of the computer program that it received as input. In an embodiment, an ex-machine uses its meta instructions and random instructions to improve its machine learning procedures as the ex-machine is computing. In an embodiment, machine computation that adds randomness and self-modification to the standard digital computer instructions has more computing capability than a standard digital computer. This capability enables more advanced machine learning procedures where in some embodiments meta instructions 1 and random instructions improve the machine learning procedure, as it is executing. In an embodiment, differential forms, the curvature tensor, and curvature of saddle points are used to help self-modify and improve an initial, standard gradient descent method.

A new computational machine is invented, called a clock machine, that is a novel alternative to computing machines (digital computers) based on logic gates. In an embodiment, computation is performed with one or more clock machines that use time. In an embodiment, a cryptographic cipher is implemented with random clock machines, constructed from a non-deterministic process, wherein the compiled set of instructions (i.e., the implementation of the cryptographic procedure) is distinct on each device or chip that executes the cryptographic cipher. In an embodiment, by using a different set of clock machines to execute two different instances of the same cryptographic procedure, each execution of a procedure looks different to malware that may try to infect and subvert the cryptographic procedure. This cryptographic process also makes timing attacks more challenging. In an embodiment, a detailed implementation of the Midori cipher with random clock machines is described.

A process of hiding a key or data inside of random noise is introduced, whose purpose is to protect the privacy of the key or data. In some embodiments, the random noise is produced by quantum randomness, using photonic emission with a light emitting diode. When the data or key generation and random noise have the same probability distributions, and the key size is fixed, the security of the hiding can be made arbitrarily close to perfect secrecy, by increasing the noise size. The hiding process is practical in terms of infrastructure and cost, utilizing the existing TCP/IP infrastructure as a transmission medium, and using light emitting diode(s) and a photodetector in the random noise generator. In some embodiments, symmetric cryptography encrypts the data before the encrypted data is hidden in random noise, which substantially amplifies the computational complexity.

Growing community of inventors

San Francisco, CA, United States of America

Michael Stephen Fiske