会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Deciphering of fragmented enciphered data packets
    • 对加密数据包进行分段解密
    • US07818564B2
    • 2010-10-19
    • US11121231
    • 2005-05-03
    • Kevin LoughranEoghan StackPeter FurlongDavid John Law
    • Kevin LoughranEoghan StackPeter FurlongDavid John Law
    • H04L29/06
    • H04L63/0485H04L63/164
    • The deciphering of fragmented enciphered IP packets is performed without requiring reassembly of the fragments. fragmented packets. When a first frame is deciphered a characteristic poly-tuple is saved against the state of the cipher, particularly an output vector. When the next frame comes in, the cipher would continue on from that previously saved state after a look-up of the poly-tuple. Each frame would then be sent on, deciphered, but still representing a fragment of the original packet. The poly-tuple employed for the look-up includes the identity and protocol fields from the IP header and at least one of the source IP address and the destination IP address. The deciphering process may commence with the combination of input data with an initializing vector and proceed by combining input data with a vector fed back from the output of the deciphering engine. The saved cipher state is employed as the initializing vector for the next frame.
    • 在不需要重新组装片段的情况下执行分段加密的IP分组的解密。 碎片包 当第一帧被解密时,针对密码的状态,特别是输出向量,保存特征多元组。 当下一帧进入时,在多元组的查找之后,密码将从先前保存的状态继续。 然后,每个帧将被发送,解密,但仍然表示原始分组的片段。 用于查找的多元组包括来自IP头部的标识和协议字段以及源IP地址和目的地IP地址中的至少一个。 解密过程可以以输入数据与初始化矢量的组合开始,并且通过将输入数据与从解密引擎的输出反馈的向量组合来进行。 采用保存的密码状态作为下一帧的初始化向量。
    • 8. 发明授权
    • Pattern matching using deterministic finite automata and organization of such automata
    • 使用确定性有限自动机的模式匹配和这种自动机的组织
    • US07672941B2
    • 2010-03-02
    • US11064257
    • 2005-02-22
    • Peter FurlongEoghan StackDavid John LawHana Hailichova
    • Peter FurlongEoghan StackDavid John LawHana Hailichova
    • G06F17/30
    • G06Q10/06
    • A deterministic finite state machine is operated to detect any one of a plurality of digital signatures each corresponding to a succession of characters and each defined by a sequence of states in the state machine. The machine is organized such that for each state after the first in any sequence there are not more than two allowed exit transitions of which one is to a default state. Input characters are examined to determine a transition from a current state of the machine to a next state. When the machine responds to an input character to perform a transition to the default state, the input character is re-examined to determine the next state of the state machine. The reduction in transitions saves considerable space in memory.
    • 操作确定性有限状态机来检测多个数字签名中的每一个对应于一系列字符的数字签名,并且每个都由状态机中的状态序列定义。 机器被组织使得对于在任何顺序中的第一个之后的每个状态,不超过两个允许的退出转换,其中一个到默认状态。 检查输入字符以确定从机器的当前状态到下一状态的转换。 当机器响应输入字符以执行到默认状态的转换时,重新检查输入字符以确定状态机的下一状态。 转换的减少节省了大量的内存空间。