利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

4 条记录 (耗时 0.012 秒)

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

    公开(公告)号：US07190791B2

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

    申请号：US10299847

    申请日：2002-11-20

    申请人： Stephen Laurence Boren ,  Andre Jacques Brisson

    发明人： Stephen Laurence Boren ,  Andre Jacques Brisson

    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
    3.
    发明申请
    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

    申请人： Stephen Laurence Boren ,  Andre Jacques Brisson

    发明人： Stephen Laurence Boren ,  Andre Jacques Brisson

    IPC分类号： H04L29/06 ,  H04L9/08

    CPC分类号： H04L9/0822 ,  H04L9/065 ,  H04L9/0825 ,  H04L9/083 ,  H04L9/0869 ,  H04L63/045 ,  H04L63/062 ,  H04W12/02 ,  H04W12/04 ,  H04W12/0608

    摘要： 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.