会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Quantum random, self-modifiable computer
    • US11468362B2
    • 2022-10-11
    • US16435500
    • 2019-06-09
    • Michael Stephen Fiske
    • Michael Stephen Fiske
    • G06N20/00G06N10/00G06F9/30
    • 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.
    • 2. 发明申请
    • Multiparty Key Exchange
    • US20210377009A1
    • 2021-12-02
    • US17399064
    • 2021-08-11
    • Michael Stephen Fiske
    • Michael Stephen Fiske
    • H04L9/08H04L9/14H04L9/30
    • 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.
    • 7. 发明申请
    • VISUAL IMAGE AUTHENTICATION
    • 视觉图像认证
    • US20160034682A1
    • 2016-02-04
    • US14857796
    • 2015-09-17
    • MICHAEL STEPHEN FISKE
    • MICHAEL STEPHEN FISKE
    • G06F21/36H04L9/14G06F3/0482
    • G06F21/36G06F3/0482G06F21/32G06F2221/2117G06F2221/2133G06Q20/32G06Q20/38215G06Q20/385G06Q20/4014G09C5/00H04L9/14H04L63/08H04L2209/24H04L2463/102H04W12/00522H04W12/06
    • Methods and systems described herein perform a secure transaction. A display 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 universal identifier is represented by images recognizable by a person, but difficult for malware to recognize.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. In an embodiment, a person presses ones finger(s) on the screen to select images as a method for authenticating and protecting communication from malware.In at least one embodiment, quantum randomness helps unpredictably vary 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.
    • 本文所述的方法和系统执行安全事务。 显示器显示难以识别恶意软件的图像,但是人们可以识别。 在至少一个实施例中,个人使用从服务提供商系统接收的可视图像来传送交易信息。 在至少一个实施例中,通用标识符由人可识别的图像表示,但恶意软件难以识别。 在一些实施例中,提供了用于通过在屏幕上生成和显示用户可以识别的视觉图像来确定是否准许访问的方法和系统。 在一个实施例中,一个人按下屏幕上的一个或多个手指来选择图像作为用于认证和保护与恶意软件的通信的方法。 在至少一个实施例中,量子随机性有助于不可预测地改变图像位置,在图像中产生噪声,或改变图像的形状或纹理。 在一些实施例中,视觉图像认证帮助Alice和Bob检测Eve是否在其密钥交换上发起了中间人攻击。
    • 8. 发明申请
    • Non-Deterministic Secure Active Element Machine
    • 非确定性安全有源元件机
    • US20150186683A1
    • 2015-07-02
    • US14643774
    • 2015-03-10
    • MICHAEL STEPHEN FISKE
    • MICHAEL STEPHEN FISKE
    • G06F21/75
    • G06F21/75G06F9/448
    • Based upon the principles of Turing incomputability, connectedness and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. This new computing machine is a non-Turing, non-register machine (non von-Neumann), called an active element machine (AEM). 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.
    • 根据图灵的不可分割性,连接性和活性元素机的新特性,构建了一种防恶意软件计算机。 这种新的计算机是非图灵,非注册机(non-von-Neumann),称为有源元件机(AEM)。 AEM程序的设计使得AEM计算的目的很难被对手和恶意软件劫持。 这些方法也可用于阻止专有算法,硬件设计和其他知识产权领域的逆向工程。 使用量子随机性,AEM可以确定地执行具有Turing不可计算的有源元件发射模式的通用图灵机(通用数字计算机程序)。 在一个实施例中,创建比Turing的计算过程(相当于数字计算机程序)更强大的计算过程。 目前的数字计算机算法和程序可以用图灵机计算程序导出或设计。 发明了一种新颖的计算机,使得程序的执行难以理解。
    • 9. 发明申请
    • Secure active element machine
    • 安全有源元件机
    • US20120198560A1
    • 2012-08-02
    • US13373948
    • 2011-12-06
    • Michael Stephen Fiske
    • Michael Stephen Fiske
    • G06F21/00
    • G06F21/75G06F9/448
    • Based upon the principle of Turing incomputability, and novel properties of the Active Element Machine, a malware-resistant computing machine is constructed. This new computing machine is a non-Turing, non-register machine (non von-Neumann), called an Active Element Machine (AEM). AEM programs are designed so that the purpose of the computation is difficult to apprehend by an adversary and hijack with malware. These methods can help hinder reverse engineering of proprietary algorithms and hardware design.Using quantum randomness, the AEM can deterministically execute a universal digital computer program with active element firing patterns that are Turing incomputable. In some embodiments, a more powerful computational procedure is demonstrated than Turing's computational procedure (digital computer procedure). Current digital computer algorithms can be derived or designed with a Turing machine computational procedure. A novel class of computing machines is built where the purpose of the program's execution is difficult to apprehend (Turing incomputable).
    • 基于图灵不可分割的原理,以及Active Element Machine的新特性,构建了一种防恶意软件计算机。 这种新的计算机是非图灵,非注册机(non-von-Neumann),称为活动元素机(AEM)。 AEM程序的设计使得计算的目的很难被对手和恶意软件劫持。 这些方法可以帮助阻碍专有算法和硬件设计的逆向工程。 使用量子随机性,AEM可以确定地执行一个通用数字计算机程序,其中包含Turing不可计算的有源元件触发模式。 在一些实施例中,与图灵的计算程序(数字计算机程序)相比,演示了更强大的计算过程。 目前的数字计算机算法可以用图灵机计算程序导出或设计。 建立了一种新型的计算机,其中程序执行的目的难以理解(图灵不可计算)。