专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

81. 发明授权

US08045708B2 Discrete key generation method and apparatus 有权
标题翻译：离散密钥生成方法和装置
公开(公告)号：US08045708B2
公开(公告)日：2011-10-25
申请号：US12124905
申请日：2008-05-21
申请人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
发明人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： H04L9/00
CPC分类号： H04L9/12 , H04L9/0861 , H04L9/3066 , H04L2209/16 , H04L2209/60
摘要： A computer enabled secure method and apparatus for generating a cryptographic key, to be used in a subsequent cryptographic process, where the key is to be valid only for example during a specified time period. The method uses a polynomial function which is a function of an input variable such as time, and dynamically computes the key from the polynomial. This is useful for generating decryption keys used for distribution of encrypted content, where the decryption is to be allowed only during a specified time period.
摘要翻译：一种用于生成加密密钥的计算机启用的安全方法和装置，用于后续密码处理，其中密钥仅在例如指定的时间段内有效。该方法使用多项式函数，该函数是诸如时间之类的输入变量的函数，并且从多项式中动态地计算密钥。这对于生成用于分发加密内容的解密密钥是有用的，其中仅在指定的时间段内允许解密。

82. 发明授权

US07984320B2 Silent time tampering detection 有权
标题翻译：静音时间篡改检测
公开(公告)号：US07984320B2
公开(公告)日：2011-07-19
申请号：US12058432
申请日：2008-03-28
申请人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
发明人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： G06F7/04 , G06F15/173
CPC分类号： G06F1/14 , G06F21/57 , G06F21/71 , G06F2221/2151
摘要： Computers and other electronic devices typically include a timing operation such as a clock in an operating system. It is anticipated that hackers may tamper with this clock. This tampering might be especially advantage in the context of systems which provide for rental of audio and video content, such as movies. Tampering with the system clock on the playing device would allow an extension of the rental period to the detriment of the provider of the rental content. Hence the present method is directed to detecting clock modifications both in terms of time shifting and clock rate tampering. This detection is done using digital signal processing.
摘要翻译：计算机和其他电子设备通常包括定时操作，诸如操作系统中的时钟。黑客可能会篡改这个时钟。这种篡改在提供音频和视频内容的租赁（例如电影）的系统的上下文中可能是特别有利的。篡改播放设备上的系统时钟将允许延长租赁期限，从而损害租赁内容的提供商。因此，本方法旨在在时移和时钟速率篡改方面检测时钟修改。该检测使用数字信号处理完成。

83. 发明申请

US20110167407A1 SYSTEM AND METHOD FOR SOFTWARE DATA REFERENCE OBFUSCATION 审中-公开
标题翻译：用于软件数据参考的系统和方法
公开(公告)号：US20110167407A1
公开(公告)日：2011-07-07
申请号：US12683145
申请日：2010-01-06
申请人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia , Julien Lerouge , Ginger M. Myles
发明人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia , Julien Lerouge , Ginger M. Myles
IPC分类号： G06F9/44
CPC分类号： G06F21/14
摘要： Disclosed herein are systems, methods, and computer-readable storage media for obfuscating software data references. The obfuscation process locates pointers to data within source code and loads the pointers into an ordered set of pools. The process further shuffles the pointers in the ordered set of pools and adds a function within the source code that when executed uses the ordered set of pools to retrieve the data. The obfuscation process utilizes pool entry shuffling, pool chaining shuffling and cross-pointer shuffling.
摘要翻译：本文公开了用于模糊软件数据引用的系统，方法和计算机可读存储介质。混淆过程将指针指向源代码中的数据，并将指针加载到有序的池集中。该过程进一步将指针排序在有序的池集中，并在源代码中添加一个函数，当执行时使用有序的池集来检索数据。混淆过程利用池进入洗牌，池链接洗牌和交叉指针洗牌。

84. 发明申请

US20110055582A1 HASH FUNCTION USING A DOMINO GAME PROCESS 审中-公开
标题翻译：使用多米诺游戏过程的快捷功能
公开(公告)号：US20110055582A1
公开(公告)日：2011-03-03
申请号：US12551362
申请日：2009-08-31
申请人： Benoit CHEVALLIER-MAMES , Mathieu Ciet , Augustin J. Farrugia
发明人： Benoit CHEVALLIER-MAMES , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： H04L9/28 , G06F21/00 , G06F7/04 , H04L9/32
CPC分类号： H04L9/3236 , G06F2221/2109
摘要： In the computer data security field, cryptographic hash function processes are embodied in a computer system and may be keyless, but are highly secure. The processes are based on the type of randomness exhibited by the well known game of dominos using a set of tiles arranged by players on a surface. Computation of the hash value (digest) is the result of executing in computer code or logic circuitry an algorithm which models such a domino game using the message as an input to the domino game algorithm, then executing the domino game algorithm. A state of the game algorithm which models the final layout of the pieces (tiles) gives the hash digest value of the message.
摘要翻译：在计算机数据安全领域中，密码散列函数过程体现在计算机系统中，并且可以是无钥匙的，但是是高度安全的。这些过程基于使用由玩家在表面上排列的一组瓦片的众所周知的多米诺骨牌游戏所展示的随机性的类型。哈希值（摘要）的计算是在计算机代码或逻辑电路中执行使用该消息作为多米诺骨牌游戏算法的输入来建模这样的多米诺骨牌游戏，然后执行多米诺牌游戏算法的算法的结果。游戏算法的状态对模块（瓦片）的最终布局进行建模，给出了消息的散列摘要值。

85. 发明申请

US20100304807A1 HASH FUNCTION USING A CUE SPORTS GAME PROCESS 失效
标题翻译： HASH功能使用CUE SPORTS游戏过程
公开(公告)号：US20100304807A1
公开(公告)日：2010-12-02
申请号：US12541850
申请日：2009-08-14
申请人： Benoit Chevallier-Mames , Mathieu Ciet , Augustin J. Farrugia
发明人： Benoit Chevallier-Mames , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： A63F9/24
CPC分类号： G06F21/64
摘要： In the computer data security field, cryptographic hash function processes embodied in a computer system and which are typically keyless, but are highly secure. The processes are based on the type of randomness exhibited by well known table “cue sports” games such as billiards, snooker, and pool played on a billiards table involving the players striking one of a plurality of balls with a cue, the struck ball then hitting other balls, the raised sides of the table, and in some cases one or more balls going into pockets in the corners and/or sides of the table. Computation of the hash value (digest) is the result of providing a model (such as expressed in computer code) of such a game algorithm and using the message as an input to the game algorithm, then executing the game algorithm. A state of the game after one or several “shots” gives the hash digest value of the message.
摘要翻译：在计算机数据安全领域中，体现在计算机系统中的加密散列函数过程通常是无钥匙的，但是是高度安全的。这些过程基于众所周知的表“提示体育”游戏（例如台球，斯诺克和游戏台）上所播放的随机性的类型，该台球在台球桌上演奏，该桌子涉及到具有提示的多个球中的一个击球者，击球击中其他球，桌子的凸起部分，以及在某些情况下一个或多个球进入桌子的角落和/或侧面的口袋。哈希值（摘要）的计算是提供这种游戏算法的模型（例如以计算机代码表示）的结果，并且使用该消息作为游戏算法的输入，然后执行游戏算法。一个或几个“拍摄”之后的游戏状态给出消息的散列摘要值。

86. 发明申请

US20100281256A1 HASH FUNCTION USING A PILING-UP PROCESS 失效
标题翻译：使用打桩过程的快速功能
公开(公告)号：US20100281256A1
公开(公告)日：2010-11-04
申请号：US12433732
申请日：2009-04-30
申请人： Augustin J. FARRUGIA , Mathieu Ciet , Benoit Chevallier-Mames
发明人： Augustin J. FARRUGIA , Mathieu Ciet , Benoit Chevallier-Mames
IPC分类号： H04L9/32
CPC分类号： H04L9/3236
摘要： In the computer data security field, a cryptographic hash function process embodied in a computer system and which is typically keyless, but is highly secure. The process is based on the type of randomness exhibited by well known tetromino stacking games. Computation of the hash value (digest) is the result of executing such a “piling on” (tetromino stacking game) algorithm using the message as an input (a seed) to a pseudo random number generator which generates the game pieces (shapes) from the resulting random numbers, then executing the game algorithm.
摘要翻译：在计算机数据安全领域中，加密散列函数过程体现在计算机系统中，并且通常是无钥匙的，但是是高度安全的。该过程是基于众所周知的tetromino堆叠游戏展示的随机类型。哈希值（摘要）的计算是使用消息作为伪随机数生成器的输入（种子）执行这样的“打桩”（四元堆叠游戏）算法的结果，该伪随机数生成器生成来自所得到的随机数，然后执行游戏算法。

87. 发明申请

US20100115276A1 SYSTEM AND METHOD FOR DERIVATING DETERMINISTIC BINARY VALUES 审中-公开
标题翻译：用于确定确定性二值的系统和方法
公开(公告)号：US20100115276A1
公开(公告)日：2010-05-06
申请号：US12263357
申请日：2008-10-31
申请人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
发明人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： H04L9/32 , G06T11/20
CPC分类号： H04L9/3236 , H04L2209/603 , H04L2209/80
摘要： Disclosed herein are systems, computer-implemented methods, and computer-readable media for deriving a deterministic binary value. The method consists of generating a graph from multiple inputs, formalizing the graph, calculating paths between starting and ending nodes in the graph using a shortest path algorithm and performing a digest operation based on the derived paths to generate a deterministic binary value. In another aspect of this disclosure, authentication is performed utilizing deterministic binary values and a graph-merging function. This method allows for diversity in complexity, thus maintaining security on different computer platforms.
摘要翻译：本文公开的是用于导出确定性二进制值的系统，计算机实现的方法和计算机可读介质。该方法包括从多个输入生成图形，使图形式化，使用最短路径算法计算图中起始和结束节点之间的路径，并且基于导出路径执行摘要操作以生成确定性二进制值。在本公开的另一方面，使用确定性二进制值和图形合并功能来执行认证。这种方法允许复杂性的多样性，从而在不同的计算机平台上保持安全性。

88. 发明申请

US20100111292A1 AGGREGATE AND PARALLELIZABLE HASH FUNCTION 审中-公开
标题翻译：集合和并发哈希函数
公开(公告)号：US20100111292A1
公开(公告)日：2010-05-06
申请号：US12263071
申请日：2008-10-31
申请人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
发明人： Pierre Betouin , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： H04L9/28
CPC分类号： H04L9/0643 , H04L2209/125
摘要： A hash provides aggregation properties, and allows distributed and/or concurrent processing. In an example, the hash operates on message M, and produces a multiplicative matrix sequence by substituting a 2×2 matrix A for binary ones and substituting a 2×2 matrix B for binary zeros in M. A and B are selected from SL2(R), R=F2[x]/(P), F2[x] being the set of polynomials degree with coefficients in F2={0,1}, and (P) is the ideal of F2[x] generated by irreducible polynomial P(x) order n=12/4. The matrix sequence is multiplied to produce a 2×2 matrix, h, with n bit length entries. A function converts h into an l×l matrix, Y. Two l×l invertible matrices with randomly chosen F2 entries, P and Q, are accessed. P pre-multiplies Y and Q−1 post-multiplies Y to produce a final hash value. M can be subdivided into m1 . . . mt, corresponding h1 . . . ht can be produced, and the Y matrix produced from a product of h1 . . . ht to get the same hash value. Respective P and Q combinations can be unique to and pre-shared with each entity pair, so only those entities can compute valid hash data. Other hash functions and implementations can be provided according to this example.
摘要翻译：散列提供聚合属性，并允许分布式和/或并发处理。在一个例子中，哈希对消息M进行操作，并且通过将2×2矩阵A代入二进制矩阵A而将2×2矩阵B替换为M中的二进制零，产生乘法矩阵序列.A和B选自SL2（ R），R = F2 [x] /（P），F2 [x]是F2 = {0,1}中的系数的多项式度的集合，（P）是不可约生成的F2 [x] 多项式P（x）阶n = 12/4。将矩阵序列相乘以产生具有n个比特长度条目的2×2矩阵h。函数将h转换为l×l矩阵Y.访问具有随机选择的F2条目P和Q的两个l×l可逆矩阵。 P预乘以Y和Q-1后乘以Y以产生最终散列值。 M可以细分为m1。。。 mt，对应h1。。。可以生产，并且由h1的乘积产生的Y矩阵。。。 ht获取相同的哈希值。各个P和Q组合可以与每个实体对唯一并预先共享，因此只有那些实体可以计算有效的散列数据。根据本例可以提供其他散列函数和实现。

89. 发明申请

US20090319769A1 DISCRETE KEY GENERATION METHOD AND APPARATUS 有权
标题翻译：分离密钥生成方法和装置
公开(公告)号：US20090319769A1
公开(公告)日：2009-12-24
申请号：US12124905
申请日：2008-05-21
申请人： Pierre BETOUIN , Mathieu Ciet , Augustin J. Farrugia
发明人： Pierre BETOUIN , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： H04L9/08 , H04L9/00
CPC分类号： H04L9/12 , H04L9/0861 , H04L9/3066 , H04L2209/16 , H04L2209/60
摘要： A computer enabled secure method and apparatus for generating a cryptographic key, to be used in a subsequent cryptographic process, where the key is to be valid only for example during a specified time period. The method uses a polynomial function which is a function of an input variable such as time, and dynamically computes the key from the polynomial. This is useful for generating decryption keys used for distribution of encrypted content, where the decryption is to be allowed only during a specified time period.
摘要翻译：一种用于生成加密密钥的计算机启用的安全方法和装置，用于后续密码处理，其中密钥仅在例如指定的时间段内有效。该方法使用多项式函数，该函数是诸如时间之类的输入变量的函数，并且从多项式中动态地计算密钥。这对于生成用于分发加密内容的解密密钥是有用的，其中仅在指定的时间段内允许解密。

90. 发明授权

US08935539B2 System and method for revising boolean and arithmetic operations 有权
标题翻译：用于修改布尔和算术运算的系统和方法
公开(公告)号：US08935539B2
公开(公告)日：2015-01-13
申请号：US13452144
申请日：2012-04-20
申请人： Mathieu Ciet , Augustin J. Farrugia , Filip Toma Paun , Jean-Francois Riendeau
发明人： Mathieu Ciet , Augustin J. Farrugia , Filip Toma Paun , Jean-Francois Riendeau
IPC分类号： G06F11/30 , G06F21/12 , H04L9/06 , G06F7/00
CPC分类号： H04L9/0612 , G06F7/00 , G06F21/125 , G06F2207/7252 , H04L9/002 , H04L2209/08 , H04L2209/12 , H04L2209/16
摘要： Disclosed herein are systems, methods, computer readable media and special purpose processors for obfuscating code. The method includes extracting an operation within program code, selecting a formula to perform the equivalent computation as the extracted operation, and replacing the extracted operation with the selected formula. The formula can be selected randomly or deterministically. The extracted operation can be an arithmetic operation or a Boolean operation.
摘要翻译：本文公开了用于对代码进行混淆的系统，方法，计算机可读介质和专用处理器。该方法包括提取程序代码内的操作，选择一个公式以执行与提取的操作等效的计算，并用所选公式替换提取的操作。公式可以随机或确定地选择。提取的操作可以是算术运算或布尔运算。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式