DEVICE FOR PROCESSING HOMOMORPHICALLY ENCRYPTED DATA

    公开(公告)号:US20240039694A1

    公开(公告)日:2024-02-01

    申请号:US18254132

    申请日:2021-11-24

    IPC分类号: H04L9/00 G06F9/38 G06F7/72

    摘要: There is provided a device for processing homomorphically encrypted data. The device includes: inter-line butterfly array blocks, each inter-line butterfly array block including inter-line modulus butterfly units, each inter-line modulus butterfly unit being configured to perform a modulus butterfly operation based on a computation pair of data points received corresponding to a pair of input data points at a same row of a matrix of input data points; intra-line butterfly array blocks, each intra-line butterfly array block including intra-line modulus butterfly units, each intra-line modulus butterfly unit being configured to perform a modulus butterfly operation based on a computation pair of data points received corresponding to a pair of input data points at a same column of the matrix of input data points; and a clock counter communicatively coupled to each inter-line butterfly array block and each intra-line butterfly array block, and configured to output a counter signal for controlling each inter-line butterfly array block and each intra-line butterfly array block to operate with single cycle initiation interval. The matrix of input data points includes columns of input data points, whereby parallel input data points derived from the homomorphically encrypted data are arranged into the columns of input data points. Furthermore, the inter-line butterfly array blocks and the intra-line butterfly array blocks are arranged in series to form a pipeline for processing the matrix of input data points.

    GENERATING CRYPTOGRAPHIC CHECKSUMS
    5.
    发明申请

    公开(公告)号:US20170244564A1

    公开(公告)日:2017-08-24

    申请号:US15504604

    申请日:2014-08-19

    IPC分类号: H04L9/32 H04L9/06

    摘要: A method (500) of generating a cryptographic checksum for a message M(x) is provided. The method comprises pseudo-randomly selecting (502) at least two irreducible polynomials pi(x). Each irreducible polynomial pi(x) is selected based on a first cryptographic key from the set of irreducible polynomials of degree ni over a Galois Field. The method further comprises calculating (503) a generator polynomial p(x) of degree n=formula (I) as a product of the N irreducible polynomials formula (II), and calculating (505) the cryptographic checksum as a first function g of a division of a second function of M(x), ƒ(M(x)), modulo p(x), i.e., g(ƒ(M(x)) mod p(x)). By replacing a standard checksum, such as a Cyclic Redundancy Check (CRC), with a cryptographic checksum, an efficient message authentication is provided. The proposed cryptographic checksum may be used for providing integrity assurance on the message, i.e., for detecting random and intentional message changes, with a known level of security. Further, a corresponding computer program, a corresponding computer program product, and a checksum generator for generating a cryptographic checksum, are provided. Σ i = 1 N  n i ( I ) p i  ( x ) , p  ( x ) = Π i = 1 N  p i  ( x ) , ( II )

    Method and Apparatus for Validating a Transaction between a Plurality of Machines
    6.
    发明申请
    Method and Apparatus for Validating a Transaction between a Plurality of Machines 审中-公开
    用于验证多台机器之间的交易的方法和装置

    公开(公告)号:US20160366109A1

    公开(公告)日:2016-12-15

    申请号:US15244985

    申请日:2016-08-23

    申请人: Peter Lablans

    发明人: Peter Lablans

    摘要: A first and a second device both have access to a series of data representing configurations of hash functions. The first device selects a first configuration and implements a hashing function from the selected configuration. A hash value is generated and transmitted to the second device. The second device has hashing configurations stored on a memory. A processor in the second device selects the first hashing configuration to implement the hash function from the first configuration and generates a hash value. The hash values generated on the first device and generated on the second device are compared to determine an action. The first configuration is disabled and a new configuration is retrieved. At least 4 and more preferably at least 5 different n-state functions with n>2 are used in a hash function.

    摘要翻译: 第一和第二设备都可以访问表示哈希函数的配置的一系列数据。 第一个设备选择第一个配置,并从所选配置中实现散列函数。 生成哈希值并将其传输到第二设备。 第二个设备具有存储在存储器上的散列配置。 第二设备中的处理器从第一配置中选择第一散列配置来实现散列函数并生成散列值。 在第一设备上生成并在第二设备上生成的散列值被比较以确定动作。 禁用第一个配置并检索新配置。 在散列函数中使用至少4个,更优选至少5个具有n≥2的n状态函数。

    Method and System of Improved Galois Multiplication
    7.
    发明申请
    Method and System of Improved Galois Multiplication 审中-公开
    改进伽罗瓦乘法的方法和系统

    公开(公告)号:US20160124717A1

    公开(公告)日:2016-05-05

    申请号:US14992918

    申请日:2016-01-11

    发明人: Walter J. Downey

    IPC分类号: G06F7/72 G06F17/10 H03M13/15

    摘要: Embodiments of the invention include an apparatus for performing Galois multiplication using an enhanced Galois table. Galois multiplication may include converting a first and second multiplicand to exponential forms using a Galois table, adding the exponential forms of the first and second multiplicands, and converting the added exponential forms of the first and second multiplicands to a decimal equivalent binary form using the Galois table to decimal equivalent binary result of the Galois multiplication.

    摘要翻译: 本发明的实施例包括一种使用增强伽罗瓦表执行伽罗瓦乘法的装置。 伽罗瓦乘法可以包括使用伽罗瓦表将第一和第二被乘数转换成指数形式,加上第一和第二被乘数的指数形式,并且使用伽罗瓦将第一和第二被乘数的相加指数形式转换为十进制等价二进制形式 表格为十进制等值二进制结果的Galois乘法。

    Method and apparatus for solving discrete logarithm problem using pre-computation table
    8.
    发明授权
    Method and apparatus for solving discrete logarithm problem using pre-computation table 有权
    使用预计算表解决离散对数问题的方法和装置

    公开(公告)号:US09077536B2

    公开(公告)日:2015-07-07

    申请号:US13358674

    申请日:2012-01-26

    IPC分类号: G06F7/72 H04L9/30

    摘要: A method and apparatus for computing a discrete logarithm using a pre-computation table are provided. The method includes previously generating the pre-computation table consisting of chains of function values obtained by applying an iterating function to a predetermined number of initial values having a generator of the cyclic group as a base and having different exponents; and if a function value obtained by applying the iterating function to a value having a target element as a base and having an exponent is identical to a function value stored in the pre-computation table, computing the discrete logarithm of the target element by using exponent information of the two function values.

    摘要翻译: 提供了一种使用预计算表来计算离散对数的方法和装置。 该方法包括以前生成的预计算表,其包括通过将迭代函数应用于具有循环组的生成器作为基础并具有不同指数的预定数量的初始值而获得的函数值链; 并且如果通过将迭代函数应用于具有目标元素作为基数并具有指数的值而获得的函数值与存储在预计算表中的函数值相同,则使用指数计算目标元素的离散对数 两个函数值的信息。