Samuel Howell Gross

US Patent:

20230086951, Mar 23, 2023

Filed:

Nov 21, 2022

Appl. No.:

17/991318

Inventors:

- Reston VA, US
Samuel S. GROSS - Manassas VA, US

Assignee:

NOBLIS, INC. - Reston VA

International Classification:

H04L 9/30
H04L 9/08
H04L 9/00

Abstract:

Techniques for determining whether a public encryption key is vulnerable as the result of deficiencies in pseudorandom number generation algorithms are provided. In some embodiments, a system may compile a database of cryptographic information received from a plurality of sources, including databases, and network traffic monitoring tools. RSA public keys extracted from the cryptographic information may be stored in an organized database in association with corresponding metadata. The system may construct a product tree from all unique collected RSA keys, and may then construct a remainder tree from the product tree, wherein each output remainder may be determined to be a greatest common divisor of one of the RSA keys against all other unique RSA keys in the database. The system may then use the greatest common divisors to factor one or more of the RSA keys and to determine that the factored keys are vulnerable to being compromised.

US Patent:

20190149331, May 16, 2019

Filed:

May 16, 2018

Appl. No.:

15/980965

Inventors:

- Reston VA, US
Samuel S. GROSS - Manassas VA, US

Assignee:

NOBLIS, INC. - Reston VA

International Classification:

H04L 9/30
H04L 9/08

Abstract:

Techniques for determining whether a public encryption key is vulnerable as the result of deficiencies in pseudorandom number generation algorithms are provided. In some embodiments, a system may compile a database of cryptographic information received from a plurality of sources, including databases, and network traffic monitoring tools. RSA public keys extracted from the cryptographic information may be stored in an organized database in association with corresponding metadata. The system may construct a product tree from all unique collected RSA keys, and may then construct a remainder tree from the product tree, wherein each output remainder may be determined to be a greatest common divisor of one of the RSA keys against all other unique RSA keys in the database. The system may then use the greatest common divisors to factor one or more of the RSA keys and to determine that the factored keys are vulnerable to being compromised.