Mass serialization analytics

• US 9,344,277 B2
• Filed: 04/11/2011
• Issued: 05/17/2016
• Est. Priority Date: 04/11/2011
• Status: Active Grant

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Simske, Steven J.
• Primary Examiner(s): Mehedi, Morshed
• Assistant Examiner(s): Naghdali, Khalil
• Application Number:
  US13/885,982
• Publication Number:
  US 20140023191A1
• Time in Patent Office: 1,863 Days
• Field of Search: 380/258, 380/26
• US Class Current: 1/1
• CPC Class Codes: G06F 21/73 by creating or determining hardware identification, e.g. serial numbers
• CPC Class Codes: G06F 7/58 Random or pseudo-random number generators
• CPC Class Codes: H04L 2209/26 Testing cryptographic entity, e.g. testing integrity of encryption key or encryption algorithm
• CPC Class Codes: H04L 9/0662 with particular pseudorandom sequence generator

Abstract

A method of determining whether a mass serialization engine is cryptographically secure is provided herein. The method includes performing (202) a specified number of mass serializations to generate a corresponding number of mass serialization sets. A size of the mass serialization sets is increased from a first portion size to a second portion size by the mass serialized engine. The method further includes determining (204) a corresponding number of collisions for each of the specified number of mass serializations. Additionally, the method includes comparing (206) the number of collisions to an expected number of collisions. Further, the method includes determining (208) whether the mass serialization engine is cryptographically secure based on the comparison.

Claims

1. A method, comprising:

performing, via a mass serialization tester of a storage device, a specified number of mass serializations to generate a corresponding number of mass serialization sets, wherein a size of the mass serialization sets is increased from a first portion size to a second portion size by a mass serialization engine, and wherein the storage device comprises the mass serialization tester and the mass serialization engine;

generating, via the mass serialization tester of a storage device, a plurality of binary strings to populate each of the mass serialization sets, wherein the mass serialization sets are of a specified size, and wherein there are 256^B possible binary strings, where B represents a length of the binary strings in bytes;

determining, via the mass serialization tester of a storage device, whether each of the plurality of binary strings results in an expected number of collisions;

determining, via the mass serialization tester of a storage device, a corresponding number of collisions for each of the specified number of mass serializations;

incrementing, via the mass serialization tester of a storage device, the corresponding number of collisions for the corresponding mass serialization sets if a collision occurs while the corresponding mass serialization sets are being increased from the first portion size to the second portion size;

comparing, via the mass serialization tester of a storage device, the corresponding number of collisions to the expected number of collisions; and

determining, via the mass serialization tester of a storage device, whether the mass serialization engine is cryptographically secure based on the comparison.

2. The method recited in claim 1, wherein determining whether the mass serialization engine is cryptographically secure comprises:

determining, via the mass serialization tester of a storage device, a mean and standard deviation of the corresponding number of collisions;

comparing, via the mass serialization tester of a storage device, the mean and the standard deviation to the expected number of collisions; and

determining, via the mass serialization tester of a storage device, whether the mass serialization engine is cryptographically secure is based on the comparison using the mean and standard deviation.

3. The method recited in claim 1, wherein each of the mass serialization sets comprise a plurality of binary strings.

4. The method recited in claim 3, wherein the expected number of collisions comprises (ln(1−

first portion)−

ln(1−

second portion)−

(second portion−

first portion))*(256^B).

5. The method recited in claim 1, wherein the mass serialization engine is one of:

a random number generator;

a random number generator using a novel sensor combination;

an encryption algorithm;

a scrambling algorithm; and

a hashing algorithm.

6. The method recited in claim 1, wherein determining whether the mass serialization engine is cryptographically secure comprises:

determining, via a mass serialization tester of a storage device, that a variance between the corresponding number of collisions and the expected number of collisions is statistically significant; and

determining, via a mass serialization tester of a storage device, that the mass serialization engine is not cryptographically secure.

7. The method recited in claim 1, wherein determining whether the mass serialization engine is cryptographically secure comprises:

determining, via a mass serialization tester of a storage device, that a variance between the corresponding number of collisions and the expected number of collisions is not statistically significant; and

determining, via a mass serialization tester of a storage device, that the mass serialization engine is cryptographically secure.

8. A computer system for processing notifications, comprising:

an event processing pipeline, comprising;

a storage device storing instructions;

a processor configured to execute the instructions to;

perform a specified number of mass serializations to generate a corresponding number of mass serialization sets comprising a plurality of binary strings using a mass serialization tester of a storage device, wherein a size of the mass serialization sets is increased from a first portion size to a second portion size by a mass serialization engine, wherein the storage device comprises the mass serialization tester and the mass serialization engine, and wherein the storage device comprises the mass serialization tester and the mass serialization engine;

determine a corresponding number of collisions for each of the specified number of mass serializations using the mass serialization tester of a storage device;

compare the number of collisions to an expected number of collisions using the mass serialization tester of a storage device, wherein the expected number of collisions comprises (ln(1−

first portion)−

ln(1−

second portion)−

(second portion−

first portion))*(256^B), where B represents a length of the binary strings in bytes; and

determine whether the mass serialization engine is cryptographically secure based on the comparison using the mass serialization tester of a storage device.

9. The computer system recited in claim 8, wherein the processor is configured to execute the instructions to determine whether the mass serialization engine is cryptographically secure by executing instructions to:

determine a mean and standard deviation of the number of collisions using the mass serialization tester of a storage device;

compare the mean and the standard deviation to the expected number of collisions using the mass serialization tester of a storage device; and

determine whether the mass serialization engine is cryptographically secure and is based on the comparison using the mean and standard deviation using the mass serialization tester of a storage device.

10. The computer system recited in claim 8, wherein the processor executes instructions to perform the specified number of mass serializations by executing instructions to:

generate a plurality of binary strings to populate each of the mass serialization sets using the mass serialization tester of a storage device, wherein the mass serialization sets are of a specified size;

determine whether each of the plurality of binary strings results in a collision using the mass serialization tester of a storage device; and

increment the corresponding number of collisions for a corresponding mass serialization set using the mass serialization tester of a storage device if the collision occurs while the corresponding mass serialization set is being increased from the first portion size to the second portion size.

11. The computer system recited in claim 8, wherein the processor executes instructions to determine whether the mass serialization engine is cryptographically secure by executing instructions to:

determine that a variance between the number of collisions and the expected number of collisions is statistically significant using the mass serialization tester of a storage device; and

determine that the mass serialization engine is not cryptographically secure using the mass serialization tester of a storage device.

12. The computer system recited in claim 8, wherein the processor executes instructions to determine whether the mass serialization engine is cryptographically secure by executing instructions to:

determine that a variance between the number of collisions and the expected number of collisions is not statistically significant using the mass serialization tester of a storage device; and

determine that the mass serialization engine is cryptographically secure using the mass serialization tester of a storage device.

13. A non-transitory, computer-readable medium comprising machine-readable instructions executable by a processor to:

perform a specified number of mass serializations to generate a corresponding number of mass serialization sets comprising a plurality of binary strings using a mass serialization tester of a storage device, wherein a size of the mass serialization sets is increased from a first portion size to a second portion size by a mass serialization engine, and wherein the storage device comprises the mass serialization tester and the mass serialization engine;

determine a corresponding number of collisions for each of the specified number of mass serializations using the mass serialization tester of a storage device;

compare the number of collisions to an expected number of collisions, wherein the expected number of collisions comprises (ln(1−

first portion)−

ln(1−

second portion)−

(second portion−

first portion))*(256^B) using the mass serialization tester of a storage device, where B represents a length of the binary strings in bytes; and

determine whether the mass serialization engine is cryptographically secure based on the comparison using the mass serialization tester of a storage device.

14. The non-transitory, computer-readable medium recited in claim 13, wherein the machine-readable instructions which, when executed by the processor, cause the processor to determine whether the mass serialization engine is cryptographically secure comprise machine-readable instructions which, when executed by the processor, cause the processor to:

determine a mean and standard deviation of the number of collisions;

compare the mean and the standard deviation to the expected number of collisions;

determine whether the mass serialization engine is cryptographically secure is based on the comparison using the mean and standard deviation;

generate a plurality of binary strings to populate each of the mass serialization sets, wherein the mass serialization sets are of a specified size;

determine whether each of the plurality of binary strings results in a collision; and

increment the corresponding number of collisions for a corresponding mass serialization set if the collision occurs while the corresponding mass serialization set is being increased from the first portion size to the second portion size.