HASH FUNCTION USING A QUASI-GROUP OPERATION
    31.
    发明申请
    HASH FUNCTION USING A QUASI-GROUP OPERATION 审中-公开
    使用组合操作的快速功能

    公开(公告)号:US20110179281A1

    公开(公告)日:2011-07-21

    申请号:US12690740

    申请日:2010-01-20

    IPC分类号: H04L9/32

    摘要: In the computer data security field, a cryptographic hash function process is embodied in a computer system or computer software or logic circuitry and is keyless, but highly secure. The process is based on (mathematical) quasi-group operations such as in the known “EDON-R” hash function. But here one or more blank rounds (iterations) of the quasi-group operation are concatenated to the EDON-R hash function operations, to overcome perceived security weaknesses in EDON-R.

    摘要翻译: 在计算机数据安全领域中,加密散列函数过程体现在计算机系统或计算机软件或逻辑电路中,并且是无钥匙的,但是非常安全。 该过程基于(数学)准组操作,例如在已知的“EDON-R”散列函数中。 但是这里准组操作的一个或多个空白回合(迭代)被连接到EDON-R散列函数操作,以克服EDON-R中感知到的安全性弱点。

    SYSTEM AND METHOD FOR DATA OBFUSCATION BASED ON DISCRETE LOGARITHM PROPERTIES
    32.
    发明申请
    SYSTEM AND METHOD FOR DATA OBFUSCATION BASED ON DISCRETE LOGARITHM PROPERTIES 有权
    基于离散对数特性的数据吞吐系统与方法

    公开(公告)号:US20110116624A1

    公开(公告)日:2011-05-19

    申请号:US12621153

    申请日:2009-11-18

    IPC分类号: G06F9/45 H04L9/28

    摘要: Disclosed herein are systems, computer-implemented methods, and computer-readable storage media for obfuscating data based on a discrete logarithm. A system practicing the method identifies a clear value in source code, replaces the clear value in the source code with a transformed value based on the clear value and a discrete logarithm, and updates portions of the source code that refer to the clear value such that interactions with the transformed value provide a same result as interactions with the clear value. This discrete logarithm approach can be implemented in three variations. The first variation obfuscates some or all of the clear values in loops. The second variation obfuscates data in a process. The third variation obfuscates data pointers, including tables and arrays. The third variation also preserves the ability to use pointer arithmetic.

    摘要翻译: 本文公开的是基于离散对数来混淆数据的系统,计算机实现的方法和计算机可读存储介质。 实施该方法的系统识别源代码中的明确值,基于清除值和离散对数,用源代码替换变换值,并更新引用清除值的源代码部分,使得 与变换值的交互提供与清除值的交互相同的结果。 这种离散对数方法可以在三个变体中实现。 第一个变体模糊了循环中的一些或全部清除值。 第二个变体在一个过程中模糊数据。 第三个变体模糊数据指针,包括表和数组。 第三个变体也保留了使用指针算术的能力。

    SPONGE AND HASH FUNCTIONS USING A RUBIK'S CUBE PUZZLE PROCESS
    33.
    发明申请
    SPONGE AND HASH FUNCTIONS USING A RUBIK'S CUBE PUZZLE PROCESS 审中-公开
    使用RUBIK的CUBE PUZZLE工艺的海绵和冲击功能

    公开(公告)号:US20110040977A1

    公开(公告)日:2011-02-17

    申请号:US12539530

    申请日:2009-08-11

    IPC分类号: H04L9/32 H04L9/28

    摘要: The present method is directed, in the computer data security field, to cryptographic sponge and hash function processes which are embodied in a computer system and are typically keyless, but highly secure. The processes are based on the type of randomness exhibited by manipulation of the well known three dimensional Rubik's cube puzzle. Computation of the hash or sponge value (digest) is the result of executing in a model (such as computer code or logic circuitry) an algorithm modeling such a puzzle using the message as an input to the cube puzzle algorithm, then executing the cube puzzle algorithm. A state of the modeled cube puzzle (the final cube puzzle arrangement) after execution gives the sponge or hash digest value of the message.

    摘要翻译: 本方法在计算机数据安全领域中涉及密码海绵和散列函数过程,这些过程体现在计算机系统中,并且通常是无钥匙的,但是高度安全。 这些过程是基于通过操纵众所周知的三维魔方谜题展示的随机性的类型。 散列或海绵值(摘要)的计算是在模型(如计算机代码或逻辑电路)中执行的算法,使用该消息建模这样一个谜题的算法作为立方谜算法的输入,然后执行立方体拼图 算法。 在执行之后,建模的立方体拼图(最终的多维数据集拼图排列)的状态给出了消息的海绵或散列摘要值。

    HASH FUNCTION USING A CARD SHUFFLING PROCESS
    34.
    发明申请
    HASH FUNCTION USING A CARD SHUFFLING PROCESS 有权
    使用卡片清理过程的快捷功能

    公开(公告)号:US20100306541A1

    公开(公告)日:2010-12-02

    申请号:US12475384

    申请日:2009-05-29

    IPC分类号: H04L9/32 H04L9/28 A63F9/24

    摘要: 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 chaos introduction exhibited by a game process such as the well known shuffling of a deck of playing cards. Computation of the hash value (digest) is the result of executing in a model (such as computer code or logic circuitry) a game algorithm that models the actual game such as a playing card shuffling algorithm using the message as an input to the algorithm, then executing the card shuffling algorithm on the input. A state (order) of the modeled deck of cards after a shuffle (or multiple shuffles) gives the hash digest value.

    摘要翻译: 在计算机数据安全领域中,加密散列函数过程体现在计算机系统中,并且通常是无钥匙的,但是是高度安全的。 该过程基于游戏过程所展示的混乱介绍的类型,诸如众所周知的一组扑克牌洗牌。 哈希值(摘要)的计算是在模型(例如计算机代码或逻辑电路)中执行游戏算法的结果,该游戏算法对使用该消息作为该算法的输入的游戏卡混洗算法进行建模, 然后在输入上执行卡混洗算法。 混洗(或多次洗牌)后,建模卡牌的状态(顺序)给出散列摘要值。

    HASH FUNCTION BASED ON POLYMORPHIC CODE
    35.
    发明申请
    HASH FUNCTION BASED ON POLYMORPHIC CODE 有权
    基于多态代码的哈希函数

    公开(公告)号:US20100281260A1

    公开(公告)日:2010-11-04

    申请号:US12433757

    申请日:2009-04-30

    IPC分类号: H04L9/32 H04L9/28

    CPC分类号: H04L9/3236

    摘要: In the field of computer data security, a hash process which is typically keyless and embodied in a computing apparatus is highly secure in terms of being resistant to attack. The hash process uses computer code (software) polymorphism, wherein computation of the hash value for a given message is partly dependent on the content (data) of the message. Hence the computer code changes dynamically while computing each hash value.

    摘要翻译: 在计算机数据安全领域,通常无钥匙和体现在计算设备中的散列过程在抵御攻击方面是高度安全的。 散列过程使用计算机代码(软件)多态,其中给定消息的散列值的计算部分地取决于消息的内容(数据)。 因此,计算机代码在计算每个散列值时动态变化。

    Securing cryptographic process keys using internal structures
    37.
    发明授权
    Securing cryptographic process keys using internal structures 有权
    使用内部结构保护加密过程密钥

    公开(公告)号:US08699702B2

    公开(公告)日:2014-04-15

    申请号:US12987933

    申请日:2011-01-10

    IPC分类号: G06F21/00 H04L9/06 H04L9/00

    摘要: In the field of cryptography, such as for a computer enabled block cipher, a cipher or other cryptographic process is hardened against an attack by protecting the cipher key or subkeys by using a masking process for these keys. The subkeys are thereby protected by applying to them a mask or set of masks to hide their contents. This is especially advantageous in a “White Box” computing environment where an attacker has full access to the cipher algorithm, including the algorithm's internal state during execution. Further, this method and the associated apparatus are useful where the key is derived through a process and so is unknown when the software code embodying the cipher is compiled. This is typically the case where there are many users of the cipher and each has his own key or where each user session has its own key.

    摘要翻译: 在密码学领域中,例如对于计算机启用的分组密码,通过使用这些密钥的掩码处理来保护加密密钥或子密钥来加密密码或其他加密过程,从而防止攻击。 因此,通过向它们施加掩模或一组掩码以隐藏其内容来保护子密钥。 这在“白盒”计算环境中特别有利,攻击者可以完全访问密码算法,包括执行过程中算法的内部状态。 此外,该方法和相关联的装置在通过过程导出密钥是有用的,并且当体现密码的软件代码被编译时是未知的。 这通常是存在密码的许多用户并且每个具有他自己的密钥或每个用户会话具有其自己的密钥的情况。

    HASH FUNCTION USING A REPEATED FUNCTION WITH SHIFTS
    38.
    发明申请
    HASH FUNCTION USING A REPEATED FUNCTION WITH SHIFTS 审中-公开
    使用具有移位功能的重复功能的快速功能

    公开(公告)号:US20110302422A1

    公开(公告)日:2011-12-08

    申请号:US12792633

    申请日:2010-06-02

    IPC分类号: H04L9/32

    CPC分类号: H04L9/3242

    摘要: In the data security field, a modular cryptographic hash function process is embodied in a computer system or hardware (circuitry). The process is based on the mode of operation of the known “Shabal” hash function which uses a keyed permutation applied to each word of the message. Here a function is substituted for the permutation and additional final rounds are added to the function. Security is further enhanced over that of the Shabal hash function by avoiding use of the message blocks in computing certain of the data arrays, in order to frustrate known message attacks.

    摘要翻译: 在数据安全领域中,模块化加密散列函数过程体现在计算机系统或硬件(电路)中。 该过程基于已知的“Shabal”散列函数的操作模式,其使用应用于消息的每个单词的密钥置换。 这里一个函数代替排列,并且附加的最后一轮被添加到该函数中。 为了阻止已知的消息攻击,避免在计算某些数据阵列时使用消息块来进一步增强安全性,而不是Shabal散列函数。

    DATA TRANSFORMATION SYSTEM USING CYCLIC GROUPS
    39.
    发明申请
    DATA TRANSFORMATION SYSTEM USING CYCLIC GROUPS 有权
    使用循环组的数据转换系统

    公开(公告)号:US20110255687A1

    公开(公告)日:2011-10-20

    申请号:US12760474

    申请日:2010-04-14

    IPC分类号: H04L9/28

    摘要: An asymmetric (dual key) data obfuscation process, based on the well known ElGamal cryptosystem algorithm, and which uses multiplicative cyclic groups to transform (obfuscate) digital data for security purposes. In the present system the data need not be a member of the cyclic group, unlike in the ElGamal cryptosystem algorithm. Also, any one of several additional mathematical data transformations are further applied to the transformed data, thereby enhancing security of the transformed data.

    摘要翻译: 基于众所周知的ElGamal密码系统算法的非对称(双密钥)数据混淆处理,为了安全起见,使用乘法循环组来转换(混淆)数字数据。 在本系统中,与ElGamal密码系统算法不同,数据不需要是循环组的成员。 而且,数字附加数学变换中的任何一个进一步应用于变换后的数据,从而提高变换数据的安全性。

    Hash function using a heap modeling process
    40.
    发明授权
    Hash function using a heap modeling process 失效
    哈希函数使用堆建模过程

    公开(公告)号:US08386787B2

    公开(公告)日:2013-02-26

    申请号:US12551267

    申请日:2009-08-31

    IPC分类号: H04L9/32

    CPC分类号: 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.

    摘要翻译: 这在计算机数据安全领域中公开了一种体现在计算机系统中的加密哈希函数过程,其可以是无钥匙的,但是是高度安全的。 该过程基于堆或堆栈的物理对象(例如一堆水果)所呈现的随机性的类型,并且涉及当从堆中移除碎片时对该堆的行为进行建模。 因此,哈希值(摘要)的计算是使用消息作为输入来初始化堆的执行堆模型算法的结果,然后执行堆模型算法,其对从串行移除对象(水果)的过程进行逻辑建模 堆在建模堆中的各个位置。