String search and matching for gate functionality

    公开(公告)号:US10681007B2

    公开(公告)日:2020-06-09

    申请号:US15825924

    申请日:2017-11-29

    Abstract: Fast string search and matching is critical for many security tasks in particular if these have “gate functionality” for instance as found in access control applications, firewalls, routers, and load balancers. The fast matching of strings is essential to impose and enforce access control policies without creating bottlenecks. Firewalls protect networks by monitoring the traffic crossing the network perimeter. The number of packet matching rules firewalls can effectively handle is limited by the matching time and space complexity of the algorithms employed. A new approach implements matching independent of the number of rules and linear in the length of the rule to be matched. A data structure used in this approach is referred to as a “Bipartite Concatenated Representation” (BCR). The space complexity of the BCR within this application scenario scales as O(N log2 N) where N is the number of rules.

    STRING SEARCH AND MATCHING FOR GATE FUNCTIONALITY

    公开(公告)号:US20180083921A1

    公开(公告)日:2018-03-22

    申请号:US15825924

    申请日:2017-11-29

    Abstract: Fast string search and matching is critical for many security tasks in particular if these have “gate functionality” for instance as found in access control applications, firewalls, routers, and load balancers. The fast matching of strings is essential to impose and enforce access control policies without creating bottlenecks. Firewalls protect networks by monitoring the traffic crossing the network perimeter. The number of packet matching rules firewalls can effectively handle is limited by the matching time and space complexity of the algorithms employed. A new approach implements matching independent of the number of rules and linear in the length of the rule to be matched. A data structure used in this approach is referred to as a “Bipartite Concatenated Representation” (BCR). The space complexity of the BCR within this application scenario scales as O(N log2 N) where N is the number of rules.

    ADAPTIVE SYSTEM PROFILE
    5.
    发明申请
    ADAPTIVE SYSTEM PROFILE 有权
    自适应系统简档

    公开(公告)号:US20160246969A1

    公开(公告)日:2016-08-25

    申请号:US14626279

    申请日:2015-02-19

    Abstract: An approach to generating and regenerating a profile value from features of a system (e.g., a computer system), allows for certain changes of features of the system over time. The system may correspond to a client computer or a particular component of the client computer or a user of a client computer, and may also correspond to a combination of the user (i.e., a biometric characterization of the user) and the client computer or a component of the computer. The profile value may be used, for example, for purposes including identification, authentication, key generation, and other cryptographic functions involving the system.

    Abstract translation: 从系统(例如,计算机系统)的特征生成和重新生成简档值的方法允许随着时间的推移对系统的特征进行某些改变。 系统可以对应于客户端计算机或客户端计算机的特定组件或客户端计算机的用户,并且还可以对应于用户的组合(即,用户的生物特征表征)和客户端计算机或者 计算机的组件。 概况值可以用于例如用于包括识别,认证,密钥生成和涉及系统的其他密码功能的目的。

Patent Agency Ranking