中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

31 records (took 0.014 seconds)

    Using cryptographic blinding for efficient use of Montgomery multiplication
    2.
    发明授权
    Using cryptographic blinding for efficient use of Montgomery multiplication 有权

    公开(公告)号：US11522669B2

    公开(公告)日：2022-12-06

    申请号：US17042006

    申请日：2019-03-26

    Applicant: CRYPTOGRAPHY RESEARCH, INC.

    Inventor： Michael Tunstall

    IPC: H04L9/00 ,  H04L9/08 ,  H04L9/30 ,  H04L9/32

    Abstract: Aspects of the present disclosure involves receiving an input message, generating a first random value that is used to blind the input message input message to prevent a side-channel analysis (SCA) attack, computing a second random value using the first random value and a factor used to compute the Montgomery form of a blinded input message without performing an explicit Montgomery conversion of the input message, and computing a signature using Montgomery multiplication, of the first random value and the second random value, wherein the signature is resistant to the SCA attack.

    SYSTEM AND METHOD TO GENERATE PRIME NUMBERS IN CRYPTOGRAPHIC APPLICATIONS
    4.
    发明申请
    SYSTEM AND METHOD TO GENERATE PRIME NUMBERS IN CRYPTOGRAPHIC APPLICATIONS 有权

    公开(公告)号：US20220085998A1

    公开(公告)日：2022-03-17

    申请号：US17447122

    申请日：2021-09-08

    Applicant: Cryptography Research, Inc.

    Inventor： Qinglai Xiao ,  Michael Alexander Hamburg ,  Michael Tunstall

    IPC: H04L9/30 ,  H04L9/00 ,  G06F7/72

    Abstract: Aspects of the present disclosure involve a method, a system and a computer readable memory to generate and use prime numbers in cryptographic operations by determining one or more polynomial functions that have no roots modulo each of a predefined set of prime numbers, selecting one or more input numbers, generating a candidate number by applying one or more instances of the one or more polynomial functions to the one or more input numbers, determining that the candidate number is a prime number, and using the determined prime number to decrypt an input into the cryptographic operation.

    CONSTANT TIME SECURE ARITHMETIC-TO-BOOLEAN MASK CONVERSION
    6.
    发明申请
    CONSTANT TIME SECURE ARITHMETIC-TO-BOOLEAN MASK CONVERSION 有权

    公开(公告)号：US20210406406A1

    公开(公告)日：2021-12-30

    申请号：US17290027

    申请日：2019-10-28

    Applicant: CRYPTOGRAPHY RESEARCH, INC.

    Inventor： Michael Hutter ,  Michael Tunstall

    IPC: G06F21/72 ,  G06F7/575 ,  G06F21/75 ,  H04L9/00

    Abstract: A first arithmetic input share and a second arithmetic input share of an initial arithmetically-masked cryptographic value are received. A sequence of operations using the arithmetic input shares and a randomly generated number is performed, where a current operation in the sequence of operations generates a corresponding intermediate value that is used in a subsequent operation. At the end of the sequence of operations, a first Boolean output share and a second Boolean output share are generated. The arithmetic-to-Boolean mask conversion is independent of the input bit length.

    MULTIPLICATIVE BLINDING FOR CRYPTOGRAPHIC OPERATIONS
    9.
    发明申请
    MULTIPLICATIVE BLINDING FOR CRYPTOGRAPHIC OPERATIONS 审中-公开
    用于拼接操作的多功能开机

    公开(公告)号：US20160277179A1

    公开(公告)日：2016-09-22

    申请号：US15073225

    申请日：2016-03-17

    Applicant: Cryptography Research, Inc.

    Inventor： Michael Tunstall

    IPC: H04L9/00 ,  H04L9/30 ,  G06F21/72

    Abstract: A value corresponding to an input for a cryptographic operation may be received. The value may blinded by multiplying the value based on an exponentiation of a random number raised to an exponent value that is associated with a public key. A cryptographic operation may be performed based on the blinded value.

    Abstract translation: 可以接收与密码操作的输入相对应的值。 通过将值的乘积乘以与提升的随机数乘以与公钥相关联的指数值的值，该值可能会蒙蔽。 可以基于盲目值进行加密操作。

    System and method to generate prime numbers in cryptographic applications
    10.
    发明授权
    System and method to generate prime numbers in cryptographic applications 有权

    公开(公告)号：US12284278B2

    公开(公告)日：2025-04-22

    申请号：US17447122

    申请日：2021-09-08

    Applicant: Cryptography Research, Inc.

    Inventor： Qinglai Xiao ,  Michael Alexander Hamburg ,  Michael Tunstall

    IPC: H04L9/30 ,  G06F7/72 ,  H04L9/00

    Abstract: Aspects of the present disclosure involve a method, a system and a computer readable memory to generate and use prime numbers in cryptographic operations by determining one or more polynomial functions that have no roots modulo each of a predefined set of prime numbers, selecting one or more input numbers, generating a candidate number by applying one or more instances of the one or more polynomial functions to the one or more input numbers, determining that the candidate number is a prime number, and using the determined prime number to decrypt an input into the cryptographic operation.

Patent Agency Ranking