Method of encryption using multi-key process to create a variable-length key
    2.
    发明授权
    Method of encryption using multi-key process to create a variable-length key 有权
    使用多键进程加密的方法来创建可变长度的密钥

    公开(公告)号:US07190791B2

    公开(公告)日:2007-03-13

    申请号:US10299847

    申请日:2002-11-20

    IPC分类号: H04K1/02 H04K1/10

    CPC分类号: H04L9/0662 H04L2209/24

    摘要: In symmetric methods of encryption the key should be as long as the plaintext message. Such a key is difficult to generate if the plaintext data to be encrypted is enormous. The present invention provides a method of creating a random key of variable length which may be extremely long. It is generated by consecutively applying sub-keys having shorter non-repeating random lengths.

    摘要翻译: 在对称的加密方法中,密钥应该与纯文本消息一样长。 如果要加密的明文数据是巨大的,则这样的密钥难以产生。 本发明提供一种创建可能长度可变的随机密钥的方法。 它是通过连续应用具有较短非重复随机长度的子密钥产生的。

    DYNAMIC IDENTITY VERIFICATION AND AUTHENTICATION CONTINUOUS, DYNAMIC ONE-TIME-PAD/ONE-TIME PASSWORDS AND DYNAMIC DISTRIBUTED KEY INFRASTRUCTURE FOR SECURE COMMUNICATIONS WITH A SINGLE KEY FOR ANY KEY-BASED NETWORK SECURITY CONTROLS

    公开(公告)号:US20170012949A1

    公开(公告)日:2017-01-12

    申请号:US14885114

    申请日:2015-10-16

    IPC分类号: H04L29/06 H04L9/08

    摘要: A method of using a single, one-time pre-distributed and pre-authenticated symmetric Whitenoise key structure or other exponential key or deterministic random number generator to establish secure key-based communications between a first source computer and a second destination computer (endpoint, sensor or smart component) to provide continuous, dynamic, one-time-pad authentication throughout a session (not just at sign-in or login). By polling ahead in an exponential key stream with specific indexes, pointers or dynamic offsets the method creates an infinite number of identifiable one-time-pad tokens that have never been created or used before and deterministic, random key streams of functionally limitless length that will easily outlive the life of the person or device deploying it. The source and destination computers each with an identical copy of a unique pre-distributed symmetric stream cipher key and a first valid offset. The offset is a pointer or index into the unique key stream to an unused and never created portion of key stream for dynamic-one-time-pad authentication or to a specific static portion of key stream as a constant identifier like the portion of the key stream to encrypt or decrypt a specific file or the secure session. The distributed key structure is a unique, deterministic random number generator that creates exponentially long, deterministic, random key streams that can have an unlimited number of offsets into the same key stream to provide any key-based network security control. The provision of this key is a one-time, non-pki key distribution generally using Identity Proofing 3 or 4 levels for pre-provisioning and pre-authentication purposes. There is never key (complete key or key structure) distribution again. The destination computer sends the source computer a random, previously unused token of variable length from the pre-distributed key beginning at the destination computer's last valid current offset. The source computer generates the corresponding token from the last valid offset for the corresponding key in respect of the destination computer. It compares the tokens bit by bit and if they are identical the source computer authenticates the destination computer. After each authentication call that is successful, the source and destination computers update there current dynamic offsets independently without any key or offset transfer by the length of the token plus 1 or some arithmetic function that moves the offset forward to an unused portion of the key stream. Communications can be sent encrypted using the same distributed key and using a similar technique to the primary authentication function.

    Method for the routing of a packet of data in a digital transmission
network
    4.
    发明授权
    Method for the routing of a packet of data in a digital transmission network 失效
    在数字传输网络中路由数据包的方法

    公开(公告)号:US5394393A

    公开(公告)日:1995-02-28

    申请号:US931708

    申请日:1992-08-18

    IPC分类号: H04L12/56 H04Q11/04 H04J3/24

    摘要: A method for the routing of a packet of data in a digital transmission network where each packet is formed by a header, enabling this packet to be identified and guided, and a part containing information elements to be conveyed. This method consists, at each node of the network, of a first step for extracting, from the header, the address of a word of a memory containing the information elements needed to identify the header and to guide the data elements conveyed by the packet coming into the node and a second step for creating, according to the header of the incoming packet and the information elements contained in the word of the memory, a new address designating a memory zone containing at least one new header and the information on the outgoing direction of the packet or packets coming out of the node. The method can be applied to digital transmission networks where it is necessary to identify and route packets of data.

    摘要翻译: 一种用于在数字传输网络中路由数据分组的方法,其中每个分组由报头形成,使得能够识别和引导该分组,以及包含要传送的信息元素的部分。 该方法包括在网络的每个节点处的第一步骤,用于从标题中提取包含识别报头所需的信息元素的存储器的字的地址,并引导由分组传送的数据元素 进入节点,第二步骤,根据输入分组的报头和包含在存储器的单词中的信息元素,创建指定包含至少一个新报头的存储区域和新出口方向信息的新地址 从节点出来的数据包或数据包。 该方法可以应用于需要识别和路由数据包的数字传输网络。