FPGA configuration bitstream protection using multiple keys
    64.
    发明授权
    FPGA configuration bitstream protection using multiple keys 有权
    FPGA配置比特流保护使用多个密钥

    公开(公告)号:US08209545B1

    公开(公告)日:2012-06-26

    申请号:US12785400

    申请日:2010-05-21

    Abstract: Circuits, methods, and apparatus that prevent detection and erasure of encoding or encryption keys. These encoding keys may be used to encode a configuration bitstream or other data for an FPGA or other device. An exemplary embodiment of the present invention masks a first key to form an encoding key in order to prevent detection of the first key. In a specific embodiment, the first key is encoded using a second key. The encoded key is used to encode a configuration bitstream or other data. The encoded key is stored on an FPGA or other device. When the device is to be configured, the encoded key is retrieved and used to decode the bitstream or other data. A further embodiment stores an encryption key in a one-time programmable memory (OTP) array to prevent its erasure or modification. The encoding key may be further obfuscated before storage.

    Abstract translation: 阻止检测和擦除编码或加密密钥的电路,方法和装置。 这些编码密钥可以用于对配置比特流或FPGA或其他设备的其他数据进行编码。 本发明的示例性实施例掩蔽第一密钥以形成编码密钥,以便防止第一密钥的检测。 在具体实施例中,使用第二密钥对第一密钥进行编码。 编码密钥用于对配置比特流或其他数据进行编码。 编码密钥存储在FPGA或其他设备上。 当要配置设备时,将检索编码密钥并将其用于解码比特流或其他数据。 另一实施例将加密密钥存储在一次性可编程存储器(OTP)阵列中以防止其擦除或修改。 在存储之前可以进一步模糊编码密钥。

    SELECTION AND/OR MODIFICATION OF AN AD BASED ON AN EMOTIONAL STATE OF A USER
    65.
    发明申请
    SELECTION AND/OR MODIFICATION OF AN AD BASED ON AN EMOTIONAL STATE OF A USER 有权
    基于用户情绪状态的AD的选择和/或修改

    公开(公告)号:US20120158504A1

    公开(公告)日:2012-06-21

    申请号:US12973329

    申请日:2010-12-20

    CPC classification number: G06Q30/0269 G06Q30/0255

    Abstract: Techniques are described herein for, among other things, selecting and/or modifying an ad based on an emotional state of a user. The user's emotional state is determined based on the user's online activity. Advertisement(s) are selected and/or modified for provision to the user based on the user's emotional state. An advertisement may be modified in any of a variety of ways. For example, a color that is included in an advertisement may be replaced with a different color. In another example, a color filter may be applied to the advertisement. In yet another example, visual attribute(s) of the advertisement may be modified. Examples of a visual attribute include, but are not limited to, hue, brightness, contrast, and saturation.

    Abstract translation: 这里描述了用于基于用户的情绪状态来选择和/或修改广告的技术。 用户的情绪状态基于用户的在线活动来确定。 根据用户的情绪状态选择和/或修改广告以供给用户。 可以以各种方式中的任何一种来修改广告。 例如,可以用不同的颜色替换广告中包括的颜色。 在另一示例中,滤色器可以应用于广告。 在又一示例中,可以修改广告的视觉属性。 视觉属性的示例包括但不限于色调,亮度,对比度和饱和度。

    Longest Prefix Match Using Binary Search Tree
    67.
    发明申请
    Longest Prefix Match Using Binary Search Tree 有权
    使用二进制搜索树的最长前缀匹配

    公开(公告)号:US20120023082A1

    公开(公告)日:2012-01-26

    申请号:US12913717

    申请日:2010-10-27

    Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.

    Abstract translation: 使用基于二叉树的搜索算法实现最长前缀匹配(LPM)。 被掩蔽的条目存储在多个二进制搜索引擎中,其中每个二进制搜索引擎存储对应的掩码长度的掩码条目。 搜索值并行应用于每个二进制搜索引擎。 搜索值被掩蔽在每个二进制搜索引擎内,由此产生多个掩码的搜索值,每个具有等于相应二进制搜索引擎的掩码长度的掩码长度。 将每个掩蔽的搜索值与对应的二进制搜索引擎的掩蔽条目进行比较。 从检测匹配的二进制搜索引擎中选择LPM结果,并具有最长的对应掩码长度。 或者,每个二进制搜索引擎存储N个掩码长度的掩蔽条目,并执行N个连续比较以识别LPM。

    Client-agnostic workflows
    70.
    发明申请
    Client-agnostic workflows 审中-公开
    客户端无关的工作流程

    公开(公告)号:US20080250387A1

    公开(公告)日:2008-10-09

    申请号:US11732966

    申请日:2007-04-04

    CPC classification number: G06F9/453

    Abstract: The subject mater herein relates to computer software and client-server based applications and, more particularly, to client-agnostic workflows. Some embodiments include one or more client-agnostic workflow application interaction models and one or more device specific transformation services. Some such embodiments provide one or more of systems, methods, and software embodied at least in part in a device specific transformation service to transform client-agnostic application interaction models, including models of workflows, to and from device or device surrogate specific formats.

    Abstract translation: 本文的主题涉及计算机软件和基于客户端 - 服务器的应用,更具体地,涉及与客户端无关的工作流程。 一些实施例包括一个或多个客户端不可知的工作流程应用交互模型和一个或多个设备特定的转换服务。 一些这样的实施例提供至少部分地体现在设备特定转换服务中的系统,方法和软件中的一个或多个,以将与客户端无关的应用交互模型(包括工作流模型)转换到设备或设备替代特定格式。

Patent Agency Ranking