Generation of prime numbers subject to an auxiliary condition in cryptographic applications
AssigneeCryptography Research, Inc.
InventorsQinglai Xiao, Michael Alexander Hamburg
Life of this patent
Estimating the term…
Loading patent…
AssigneeCryptography Research, Inc.
InventorsQinglai Xiao, Michael Alexander Hamburg
Estimating the term…
Aspects of the present disclosure involve a method, a system and a computer readable memory to generate and use prime numbers in cryptographic applications using operations that include selecting a subset of prime numbers and identifying polynomial function(s) that (i) have no roots modulo each of the subset of prime numbers and (ii) generate outputs that are congruent to a predetermined value modulo a reference value. The operations further include selecting one or more input values, applying the one or more polynomial function(s) to the one or more input values to generate a candidate number, determining that the candidate number is a prime number, and computing using the determined prime number, an output of a cryptographic operation.
A method to perform a cryptographic operation, the method comprising:
A system comprising:
A non-transitory computer-readable medium storing instructions thereon, wherein the instructions, when executed by a processing device performing a cryptographic operation, cause the processing device to:
Dependencies are inferred from the claim text.