-
公开(公告)号：US07975149B2
公开(公告)日：2011-07-05
申请号：US11428190
申请日：2006-06-30
CPC分类号： G06F12/1416 , G06F12/0802 , G06F12/1408 , G06F21/556
摘要： Software protection using data structures is described. In one implementation, an engine between the processor and the memory of a computing device encrypts and stores data and program variables in blocks of memory that correspond to nodes of a tree-like data structure. When accessed, the nodes of this search tree are rearranged according to various schemata to obscure memory access patterns from being detected by cache attacks or side-channel attacks. In one implementation, the data structure is a splay tree that self-rearranges upon access and increases efficiency while providing security.
摘要翻译： 描述使用数据结构的软件保护。 在一个实现中，处理器和计算设备的存储器之间的引擎将对应于树状数据结构的节点的数据块和程序变量加密并存储在存储器块中。 当访问时，根据各种模式重新排列该搜索树的节点，以掩盖由高速缓存攻击或侧向信道攻击检测到的存储器访问模式。 在一个实现中，数据结构是一个显示树，在访问时自我重新排列，并在提供安全性的同时提高效率。
-
公开(公告)号：US20060248338A1
公开(公告)日：2006-11-02
申请号：US11119405
申请日：2005-04-29
IPC分类号： H04L9/00
CPC分类号： H04L9/3247 , G06F21/64 , H04L9/3073 , H04L9/321 , H04L2209/56
摘要： Techniques are described for generating and validating signatures. In an implementation, a method includes generating a signature by utilizing a plurality of isogenies included on a private key and incorporating the signature and a public key on a product, in which the public key is configured to validate the signature.
-
3.发明授权Systems and methods for generation and validation of isogeny-based signatures 有权用于生成和验证基于同位素的签名的系统和方法公开(公告)号：US07617397B2
公开(公告)日：2009-11-10
申请号：US11119405
申请日：2005-04-29
IPC分类号： H04L9/32
CPC分类号： H04L9/3247 , G06F21/64 , H04L9/3073 , H04L9/321 , H04L2209/56
摘要： Techniques are described for generating and validating signatures. In an implementation, a method includes generating a signature by utilizing a plurality of isogenies included on a private key and incorporating the signature and a public key on a product, in which the public key is configured to validate the signature.
摘要翻译： 描述了生成和验证签名的技术。 在一个实现中，一种方法包括通过利用包含在私钥上的多个基因并将签名和公钥合并到产品上来生成签名，其中公钥被配置为验证签名。
-
公开(公告)号：US07587605B1
公开(公告)日：2009-09-08
申请号：US10804835
申请日：2004-03-19
CPC分类号： H04L9/3073 , H04L9/3247 , H04L2209/20
摘要： In at least one implementation, described herein, P and Q1, . . . , Qn are public points on an elliptic curve over a finite field, but the ratios of Qi to P are private. Those ratios are the components (α1, . . . , αn) of a private key, where Qi=αi P. This implementation generates short digital ciphers (i.e., signatures), at least in part, by mapping a message M to a point T on the elliptic curve and then scaling that point T based upon the private key α to get S. At least one other implementation, described herein, verifies those ciphers by comparing pairing values of two pairs, where one pair is the public point P and the scaled point S and another pair is public Q and the point T. This implementation tests whether log(Q)/log(P)=log(S)/log(T), without computing any elliptic curve discrete logarithm directly.
摘要翻译： 在这里描述的至少一个实施例中，P和Q1。 。 。 Qn是有限域上的椭圆曲线上的公共点，但是Qi与P之比是私有的。 这些比率是私钥的组件（alpha1，...，alphan），其中Qi = alphai P.该实现至少部分地通过将消息M映射到点来生成短数字密码（即，签名） T在椭圆曲线上，然后基于获得S的私钥α对该点T进行缩放。本文描述的至少一个其他实现通过比较两对的配对值来验证那些密码，其中一对是公共点P和 缩放点S和另一对是公共Q和点T.该实现测试log（Q）/ log（P）= log（S）/ log（T），而不直接计算任何椭圆曲线离散对数。
-
公开(公告)号：US20080022102A1
公开(公告)日：2008-01-24
申请号：US11428190
申请日：2006-06-30
IPC分类号： H04L9/00
CPC分类号： G06F12/1416 , G06F12/0802 , G06F12/1408 , G06F21/556
摘要： Software protection using data structures is described. In one implementation, an engine between the processor and the memory of a computing device encrypts and stores data and program variables in blocks of memory that correspond to nodes of a tree-like data structure. When accessed, the nodes of this search tree are rearranged according to various schemata to obscure memory access patterns from being detected by cache attacks or side-channel attacks. In one implementation, the data structure is a splay tree that self-rearranges upon access and increases efficiency while providing security.
摘要翻译： 描述使用数据结构的软件保护。 在一个实现中，处理器和计算设备的存储器之间的引擎将对应于树状数据结构的节点的数据块和程序变量加密并存储在存储器块中。 当访问时，根据各种模式重新排列该搜索树的节点，以掩盖由高速缓存攻击或侧向信道攻击检测到的存储器访问模式。 在一个实现中，数据结构是一个显示树，在访问时自我重新排列，并在提供安全性的同时提高效率。
-
6.发明授权Accelerating public-key cryptography by precomputing randomly generated pairs 失效通过预先计算随机生成的对来加速公钥密码术
公开(公告)号：US6091819A
公开(公告)日：2000-07-18
申请号：US912251
申请日：1997-08-15
CPC分类号： H04L9/3013 , H04L9/0869 , H04L2209/08 , H04L2209/26
摘要： Fast methods for generating randomly distributed pairs of keys for use in public-key cryptography use a precomputation step to reduce the online task of discrete exponentiation with long integers. After the precomputation is completed, the online steps required to produce a key pair are reduced to a small number .kappa. (about 16) of modular multiplications with long integers. The key pairs are of the form (k, g.sup.k) or (k, k.sup.e) where the exponentiations are computed modulo a long number p, g and e are fixed integers, and k is randomly distributed modulo ord(g), where ord(g) is the smallest positive integer that satisfies g.sup.ord(g) modulo p=1. The complexity of doing the precomputation step is itself about n exponentiation and may be accelerated to the same as two exponentiations, but the precomputation step needs to be done only very infrequently. Under easily achieved conditions, an adversary cannot analyze enough key pairs to gain a significant advantage from the knowledge that the method is being used.
摘要翻译： 用于生成用于公钥密码术的随机分布密钥对的快速方法使用预计算步骤来减少具有长整数的离散求幂的在线任务。 在预先计算完成之后，产生密钥对所需的在线步骤被减少到具有长整数的模数乘法的小数kappa（约16）。 密钥对具有形式（k，gk）或（k，ke），其中计算的幂是模数长数p，g和e是固定整数，k是随机分布的模ord（g），其中ord g）是满足gord（g）模p = 1的最小正整数。 执行预计算步骤的复杂度本身就是n取幂，并且可以被加速到与两个指数相同，但是预计算步骤仅需很少地进行。 在容易实现的条件下，对手无法分析足够的密钥对，从获得该方法的知识中获得显着的优势。
-
公开(公告)号：US08989706B2
公开(公告)日：2015-03-24
申请号：US13335454
申请日：2011-12-22
摘要： Systems, methods, and/or techniques (“tools”) are described herein that relate to automated secure pairing for devices, and that relate to parallel downloads of content using devices. The tools for pairing the devices may perform authentication protocols that are based on addresses and on keys. The address-based authentication protocol may operate on address book entries maintained by the devices. The key-based authentication protocol may operate using a key exchange between the devices.
摘要翻译： 这里描述了与设备的自动安全配对相关的系统，方法和/或技术（“工具”），并且涉及使用设备的内容的并行下载。 用于配对设备的工具可以执行基于地址和密钥的认证协议。 基于地址的认证协议可以对由设备维护的地址簿条目进行操作。 基于密钥的认证协议可以使用设备之间的密钥交换来操作。
-
公开(公告)号：US08595276B2
公开(公告)日：2013-11-26
申请号：US12782647
申请日：2010-05-18
IPC分类号： G06F1/02
CPC分类号： H04N7/167 , H04N21/8358
摘要： Techniques are disclosed to provide randomized signal transforms and/or their applications. More particularly, a signal (e.g., an audio signal, an image, or a video signal) is transformed by applying randomly-selected basis functions to the signal. The applications of the randomized signal transforms include, but are not limited to, compression, denoising, hashing, identification, authentication, and data embedding (e.g., watermarking).
摘要翻译： 公开了提供随机信号变换和/或其应用的技术。 更具体地，通过对信号应用随机选择的基函数来变换信号（例如，音频信号，图像或视频信号）。 随机信号变换的应用包括但不限于压缩，去噪，散列，识别，认证和数据嵌入（例如，水印）。
-
公开(公告)号：US08364617B2
公开(公告)日：2013-01-29
申请号：US11625249
申请日：2007-01-19
CPC分类号： G06N99/005 , G06K9/6256 , G06K9/6269 , G06K9/6292
摘要： A classification system is described for resilient classification of data. In various embodiments, the classification system divides a full set of the training data into a positive subset and a negative subset. The positive subset contains all training data with a positive classification value and the negative subset contains all training data with a negative classification value. The classification system constructs several subsets of the training data wherein each subset contains data randomly selected from both the positive subset and the negative subset. The classification system then creates at least two classifiers based on each of the randomly created subsets of the training data.
摘要翻译： 描述了对数据进行弹性分类的分类系统。 在各种实施例中，分类系统将整套训练数据划分为正子集和负子集。 正子集包含具有正分类值的所有训练数据，负子集包含具有负分类值的所有训练数据。 分类系统构建训练数据的几个子集，其中每个子集包含从正子集和负子集两者随机选择的数据。 分类系统然后基于训练数据的随机创建的子集中的每一个创建至少两个分类器。
-
10.发明授权公开(公告)号：US08032754B2
公开(公告)日：2011-10-04
申请号：US10754235
申请日：2004-01-09
IPC分类号： H04L9/32
CPC分类号： G06T1/005 , G06T2201/0052 , G06T2201/0063 , G06T2201/0065 , G06T2201/0083 , H04N1/32144 , H04N1/32187 , H04N1/32229 , H04N2201/3205 , H04N2201/323 , H04N2201/327
摘要： The present invention leverages a series of media watermark locations to provide information relating to media ownership and/or distribution source. This provides a forensic means to establish a source of media with a high degree of certainty despite malicious and/or non-malicious attacks. By providing embedded user unique identification, a source of copied media can be determined without the embedded information substantially interfering with the intended purpose of the media itself. In one instance of the present invention, digital media is transformed into an N-dimensional media signal. User unique keys are then utilized along with a master key to determine locations for embedding a watermark signal that possesses substantially similar quantized statistics as the transformed media signal. The watermark signal is then embedded into the media signal, fingerprinting the media.
摘要翻译： 本发明利用一系列媒体水印位置来提供与媒体所有权和/或分发源相关的信息。 这提供了一种法医手段，尽管恶意和/或非恶意攻击具有高度确定性的媒体来源。 通过提供嵌入式用户唯一标识，可以确定复制媒体的来源，而不会使嵌入的信息基本上干扰媒体本身的预期目的。 在本发明的一个实例中，数字媒体被转换为N维媒体信号。 然后，用户唯一密钥与主密钥一起被使用以确定用于嵌入具有基本相似的量化统计量的水印信号作为变换的媒体信号的位置。 然后将水印信号嵌入到媒体信号中，对媒体进行指纹识别。
-
-
-
-
-
-
-
-
-
搜索结果
193 条记录 (耗时 0.023 秒)
