Method for generating cryptographic “one-time pads” and keys for secure network communications

• US 9,762,560 B2
• Filed: 11/05/2015
• Issued: 09/12/2017
• Est. Priority Date: 11/25/2014
• Status: Active Grant

• Current Assignee: Aclara Technologies LLC (Hubbell, Inc.)
• Original Assignee: Aclara Technologies LLC (Hubbell, Inc.)
• Inventors: Haynes, David, Emelko, Glenn
• Primary Examiner(s): Desrosiers, Evans
• Assistant Examiner(s): Tran, Vu V
• Application Number:
  US14/933,533
• Publication Number:
  US 20160149879A1
• Time in Patent Office: 677 Days
• Field of Search: 713170
• CPC Class Codes: G09C 5/00 Ciphering apparatus or methods not provided for in the preceding groups, e.g. involving the concealment or deformation of graphic data such as designs, written or printed messages
• CPC Class Codes: H04L 63/0435 wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption cryptographic mechanisms or cryptographic arrangements for symmetric key encryption H04L9/06
• CPC Class Codes: H04L 63/062 for key distribution, e.g. centrally by trusted party cryptographic mechanisms or cryptographic arrangements for key distribution involving a central third party H04L9/0819
• CPC Class Codes: H04L 63/067 using one-time keys cryptographic mechanisms or cryptographic arrangements for generation of one-time passwords H04L9/0863
• CPC Class Codes: H04L 63/0823 using certificates cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263
• CPC Class Codes: H04L 9/0822 using key encryption key
• CPC Class Codes: H04L 9/0866 involving user or device identifiers, e.g. serial number, physical or biometrical information, DNA, hand-signature or measurable physical characteristics

Abstract

A method of generating random and pseudo-random material which is incorporated in devices located at each end of a communications network for secure communications through a channel of the network. The material is used to generate time based one-time pads, one-time keys, and the keys themselves. The one-time pads, one-time keys, and the keys support a key-based or pad based cryptographic technique employed to produce secure communications of messages transmitted through the channel with a one-time pad, one-time key, or a key generated at one interval of time being different and unique from a one-time pad, one-time key, or a key generated at any other interval of time.

Claims

1. A secure method for generating random or pseudo- random material used to create one-time pads, one-time keys, and reusable private keys, the pads and/or the keys being used in a pad or key based cryptographic system for secure communications between at least two parties over a communications channel in which corresponding devices are installed at respective transmission and receiving ends of the channel for secure communications between the parties;

the method comprising;

generating a computer based binary image comprising a plurality of data bits with each one-time pad being formed from said bits, the randomly and pseudo-randomly generated data bits being stored in a memory whose contents include the image;

selecting a bit group within the image for generating each one-time pad, selection of the group being time based so that the starting point within the binary image from which the group selected for each one-time pad is a function of an interval of time which is different than that for any other one-time pad that is generated, each one-time pad that is generated being used only once for the encryption and decryption of a single message and then discarded and not reused whereby the message produced by one party using the one-time pad and sent to the other party is not discernible by others; and

,

wherein a bit location in the binary image used as a starting point for producing the data bit group used to generate a one-time pad is determined as;

bitLocation=(time)mod(sizeOf(ROM))

where time is a fixed value expressed as the number of seconds since the beginning of a predetermined epoch;

mod is a modulo operation; and

sizeOf indicates the size of a ROM memory space in bits.

2. The method of claim 1 further including use of a mask to determine which data bits within the binary image can be used, the selection of bits determined by the mask being computed as:

mask_group=time⊕

UserCertificate⊕

ProviderCertificate

wherein the UserCertificate is a value that uniquely identifies a user of the method and a ProviderCertificate is a value issued by a producer or provider of a device in which the binary image is embedded together with a source code used to execute the method.

3. The method of claim 2 in which a UserCertificate is installed in a non-volatile memory of a device at the time of the device'"'"'s manufacture;

and the ProviderCertificate is installed in a source code implemented by the provider of the device at the time of compilation of the source code in the device.

4. The method of claim 1 further including performing a Von Neumann whitening of data produced for generating a one-time pad to enhance the randomness of the data used.

5. The method of claim 4 further including using hashing algorithms to enhance the randomness of the data used.

6. The method of claim 1 wherein the binary image is incorporated in a computer chip embedded in a device installed in at least one of a transmission end or a receiving end of a communications channel over which the message is sent.

7. The method of claim 2 further including simultaneously generating an encryption key and an authentication key for use with a message, the encryption key being generated when mask bits of one binary value are encountered, and the authentication key being generated when mask bits of the other binary value are encountered.

8. The method of claim 1 for communications between the following:

one party to one party;

one party to many parties;

many parties to one party; and

many parties to many parties.