会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method of updating encryption keys in a data communication system
    • 在数据通信系统中更新加密密钥的方法
    • US07203834B1
    • 2007-04-10
    • US09573527
    • 2000-05-17
    • Alain BenayounJean-Francois LePennecPatrick Michel
    • Alain BenayounJean-Francois LePennecPatrick Michel
    • H04L9/28H04L9/00
    • H04L9/0891H04L9/12H04L2209/30H04L2209/60
    • The invention discloses a method of updating, in nodes on both ends of a secure link, the encryption key they share to encrypt and decrypt data. When having to transmit data from one of the nodes towards its peer remote node, a data base in the forwarding node, is first updated from the data to be transmitted. Then, encryption is performed and data transmitted to the peer remote node while a next-to-use encryption key is derived from the new contents of the data base. When received, data are decrypted with the current value of the encryption key and the peer remote node data base is updated identically from the received decrypted data after which a next-to-use encryption key is derived, thereby obtaining in the peer remote node, a next-to-use identical key. The data base is preferably the dictionary of a data compression/decompression system used simultaneously with encryption/decryption to transmit data over the secure link. While keys are frequently updated, for improved security, the invention does not require that key updates need to be actually distributed.
    • 本发明公开了一种在安全链路两端的节点中更新其共享的加密密钥来加密和解密数据的方法。 当必须从其中一个节点向其对等远程节点发送数据时,转发节点中的数据库首先从要发送的数据更新。 然后,在从数据库的新内容导出下一个即用加密密钥的同时,执行加密并将数据发送到对等远程节点。 当接收到数据时,利用加密密钥的当前值解密数据,并从所接收的解密数据中对等远程节点数据库进行相同的更新,之后导出下一个使用加密密钥,从而在对等远程节点获得, 下一个使用相同的键。 数据库优选地是与加密/解密同时使用的数据压缩/解压缩系统的字典,以通过安全链路传输数据。 虽然密钥经常更新,为了提高安全性,本发明不需要密钥更新需要实际分发。
    • 3. 发明授权
    • System for performing data compression based on a Liu-Zempel algorithm
    • 基于Liu-Zempel算法进行数据压缩的系统
    • US5701468A
    • 1997-12-23
    • US444139
    • 1995-05-18
    • Alain BenayounJacques FieschiPatrick MichelJean-Francois LePennec
    • Alain BenayounJacques FieschiPatrick MichelJean-Francois LePennec
    • G06F5/00G06T9/00H03M7/30H03M7/40H03M7/46
    • H03M7/3088G06T9/005Y10S707/99942
    • Data compression using a Liv-Zempel algorithm is enhanced by organizing strings of data in a dictionary using a set of related four related fields. The first field contains an index or codeword for the last character of the string currently being processed. The second field contains an index or codeword for a SON string, a string which includes all of the characters of the current string plus one additional character. The third field contains an index or codeword for a BROTHER string which is identical to the current string except that the last characters in the two strings differ. The fourth field contains an index or codeword for a PARENT to the current string. The PARENT includes all of the characters of the current string except the last character. The memory arrangement comprises a tree structure which can be efficiently accessed by a disclosed processor to perform data compression using minimal processing resources.
    • 使用Liv-Zempel算法的数据压缩通过使用一组相关的四个相关字段组织字典中的数据串来增强。 第一个字段包含当前正在处理的字符串的最后一个字符的索引或代码字。 第二个字段包含SON字符串的索引或代码字,一个包含当前字符串的所有字符加上一个附加字符的字符串。 第三个字段包含与当前字符串相同的BROTHER字符串的索引或代码字,但两个字符串中的最后一个字符不同。 第四个字段包含用于当前字符串的PARENT的索引或代码字。 PARENT包括除最后一个字符之外的当前字符串的所有字符。 存储器装置包括树结构,其可以被公开的处理器有效地访问以使用最少的处理资源执行数据压缩。