Cracking private key of asymmetric cryptosystem
AssigneeRaine Conor Research, LLC
InventorRaine Conor
Life of this patent
Estimating the term…
Abstract
A method of cracking a private key of an asymmetric cryptosystem includes extracting a modulus and a public key exponent from a public key, calculating the digital root of the modulus, deriving a set of candidate base pairs corresponding to the digital root and the last digit of the modulus, each of the candidate base pairs including a first candidate base and a second candidate base, iteratively testing values of a multiplier until a sum of one of the candidate bases with ninety times the multiplier is a factor of the modulus, and determining the private key using the public key exponent and the factor of the modulus. The method may further include decrypting an encrypted message using the private key.
Claims24
A non-transitory program storage medium on which are stored instructions executable by a processor or programmable circuit to perform operations for cracking a private key of an asymmetric cryptosystem, the operations comprising:
- extracting a modulus and a public key exponent from a public key;
- calculating the digital root of the modulus;
- deriving a set of candidate base pairs corresponding to the digital root and the last digit of the modulus, each of the candidate base pairs including a first candidate base and a second candidate base;
- iteratively testing values of a multiplier until a sum of one of the candidate bases with ninety times the multiplier is a factor of the modulus;
- and
- determining the private key using the public key exponent and the factor of the modulus.
A method of cracking a private key of an asymmetric cryptosystem, the method comprising:
- extracting a modulus and a public key exponent from a public key;
- calculating the digital root of the modulus;
- deriving a set of candidate base pairs corresponding to the digital root and the last digit of the modulus, each of the candidate base pairs including a first candidate base and a second candidate base;
- iteratively testing values of a multiplier until a sum of one of the candidate bases with ninety times the multiplier is a factor of the modulus;
- and
- determining the private key using the public key exponent and the factor of the modulus.
A system for cracking a private key of an asymmetric cryptosystem, the system comprising:
- an n/e extractor for extracting a modulus and a public key exponent from a public key;
- a digital root calculator for calculating the digital root of the modulus;
- a candidate base pair deriving engine for deriving a set of candidate base pairs corresponding to the digital root and the last digit of the modulus, each of the candidate base pairs including a first candidate base and a second candidate base;
- an iterator for iteratively testing values of a multiplier until a sum of one of the candidate bases with ninety times the multiplier is a factor of the modulus;
- and
- a private key determiner for determining the private key using the public key exponent and the factor of the modulus.
Dependencies are inferred from the claim text.