会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 82. 发明授权
    • Protecting states of a cryptographic process using group automorphisms
    • 使用组自动化保护加密过程的状态
    • US08504845B2
    • 2013-08-06
    • US13076362
    • 2011-03-30
    • Augustin J. FarrugiaMathieu CietThomas Icart
    • Augustin J. FarrugiaMathieu CietThomas Icart
    • H04L9/28
    • G06F21/602G06F21/52
    • In the field of computer enabled cryptography, such as a keyed block cipher having a plurality of rounds, the cipher is hardened against an attack by a protection process which obscures the cipher states and/or the round keys using the properties of group field automorphisms and applying multiplicative masks (instead of conventional XOR masks) to the states of the cipher, for encryption or decryption. This is especially advantageous in a “White Box” environment where an attacker has full access to the cipher algorithm, including the algorithm's internal state during its execution. This method and the associated computing apparatus are useful for protection against known attacks on “White Box” ciphers, by eliminating XOR operations with improved masking techniques and increasing complexity of reverse engineering and of attacks.
    • 在诸如具有多个回合的密钥分组密码的计算机启用密码学领域中,使用组域自动生成的属性,使密码状态和/或循环密钥隐藏的保护过程针对攻击进行加密, 将乘法掩码(而不是常规XOR掩码)应用于密码的状态,以进行加密或解密。 这在“白盒”环境中特别有利,攻击者可以完全访问密码算法,包括算法的执行过程中的内部状态。 该方法和相关联的计算装置对于通过利用改进的掩蔽技术消除XOR操作并增加逆向工程和攻击的复杂性来防止已知的对“白盒”密码的攻击是有用的。
    • 86. 发明申请
    • OBFUSCATING TRANSFORMATIONS ON DATA ARRAY CONTENT AND ADDRESSES
    • 对数据阵列内容和地址进行变形
    • US20110246787A1
    • 2011-10-06
    • US12753021
    • 2010-04-01
    • Augustin J. FarrugiaMathieu CietBenoit Chevallier-Mames
    • Augustin J. FarrugiaMathieu CietBenoit Chevallier-Mames
    • G06F12/14
    • G06F21/60G06F21/14G06F2221/2107G09C1/00H04L2209/04
    • In a first computer (digital) data obfuscation process, data which is conventionally arranged in a data structure called an array (e.g., a table) and conventionally stored in computer or computer device memory is obfuscated (masked) by logically or mathematically combining the data, entry-by-entry, with a masking value which is computed as a logical or mathematical function of the entry itself or its index in the array, modulo a security value. The complementary unmasking value is a pointer to the entry's address in the table modulo the security value. In a second computer (digital) data obfuscation process, the addresses (location designations) in memory of a data array are themselves obfuscated (masked) by partitioning the array into blocks of entries and shuffling the order of the data entries in each block by a predetermined algorithm, resulting in a shuffled array also differing from the original array in terms of its size (the total number of entries).
    • 在第一计算机(数字)数据混淆处理中,通过逻辑地或数学地组合数据来模拟(掩蔽)常规地被布置在被称为阵列(例如,一个表格)的数据结构中并且通常存储在计算机或计算机设备存储器中的数据 逐个输入,具有屏蔽值,其被计算为条目本身的逻辑或数学函数或其阵列中的索引,模数为安全值。 补充取消掩码值是指向该表中条目地址的指针,以模拟安全值。 在第二计算机(数字)数据混淆处理中,数据阵列的存储器中的地址(位置指定)本身通过将阵列划分成条目块并将每个块中的数据条目的顺序按顺序排列(A)来进行混淆(掩蔽) 预定的算法,导致在其大小(入口总数)方面与原始阵列不同的混洗阵列。
    • 87. 发明申请
    • HASH FUNCTION USING A HEAP MODELING PROCESS
    • HASH功能使用HEAP建模过程
    • US20110055576A1
    • 2011-03-03
    • US12551267
    • 2009-08-31
    • Augustin J. FarrugiaBenoit Chevallier-MamesMathieu Ciet
    • Augustin J. FarrugiaBenoit Chevallier-MamesMathieu Ciet
    • H04L9/32
    • H04L9/3236
    • This discloses, in the computer data security field, a cryptographic hash function process embodied in a computer system and which may be keyless, but is highly secure. The process is based on the type of randomness exhibited by a heap or stack of physical objects such as a heap of pieces of fruit and involves modeling the behavior of such a heap when pieces are removed from the heap. Computation of the hash value (digest) is thereby the result of executing a heap model algorithm using the message as an input to initialize the heap, then executing the heap model algorithm which logically models the process of serially removing objects (pieces of fruit) from the heap at various locations in the modeled heap.
    • 这在计算机数据安全领域中公开了一种体现在计算机系统中的加密哈希函数过程,其可以是无钥匙的,但是是高度安全的。 该过程基于堆或堆栈的物理对象(例如一堆水果)所呈现的随机性的类型,并且涉及当从堆中移除碎片时对该堆的行为进行建模。 因此,哈希值(摘要)的计算是使用消息作为输入来初始化堆的执行堆模型算法的结果,然后执行堆模型算法,其对从串行移除对象(水果)的过程进行逻辑建模 堆在建模堆中的各个位置。
    • 88. 发明申请
    • HASH FUNCTION USING A ROULETTE GAME PROCESS
    • 使用ROULETTE游戏过程的HASH功能
    • US20100304826A1
    • 2010-12-02
    • US12475353
    • 2009-05-29
    • Benoit CHEVALLIER-MAMESMathieu CietAugustin J. Farrugia
    • Benoit CHEVALLIER-MAMESMathieu CietAugustin J. Farrugia
    • A63F9/24
    • 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 the well known gambling game of roulette played on a roulette wheel involving dropping a ball onto a partitioned spinning wheel. The ball loses momentum and drops into one of the partitions (pockets) of the wheel. Computation of the hash value (digest) is the result of executing in a model (such as computer code or logic circuitry) such a game algorithm using the message as an input to the game algorithm, then executing the game algorithm. A state of the game (the final ball location) after a ball (or several balls) are played gives the hash digest value of the message.
    • 在计算机数据安全领域中,加密散列函数过程体现在计算机系统中,并且通常是无钥匙的,但是是高度安全的。 这个过程是基于在轮盘赌上玩的轮盘赌的众所周知的赌博游戏展示的随机性类型,包括将球落在分隔的旋转轮上。 球失去动量并落入车轮的一个分区(口袋)中。 哈希值(摘要)的计算是在使用该消息作为游戏算法的输入的游戏算法的模型(诸如计算机代码或逻辑电路)中执行的结果,然后执行游戏算法。 球(或几球)播放后的游戏状态(最终球位置)给出消息的散列摘要值。