Encryption/decryption system and method

• US 8,345,876 B1
• Filed: 03/06/2012
• Issued: 01/01/2013
• Est. Priority Date: 03/06/2012
• Status: Expired due to Fees

• Current Assignee: Charles Gordon Sinn, Robert Mannerstedt Sinn, Robert Samuel Sinn
• Original Assignee: Charles Gordon Sinn, Robert Mannerstedt Sinn, Robert Samuel Sinn
• Inventors: Sinn, Robert Samuel, Sinn, Charles Gordon, Sinn, Robert Mannerstedt
• Primary Examiner(s): ZIA, SYED
• Application Number:
  US13/413,603
• Time in Patent Office: 301 Days
• Field of Search: None
• US Class Current: 380/255
• CPC Class Codes: H04L 9/0656 Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher

Abstract

A method of encrypting a plain text message that is m characters in length is described. A one off random key having a length of m characters is generated. The random key uses a character set and modulus that is compatible with the plain text message. A first substitution encryption of the plain text message is performed using the generated random key. A string of random fill characters that is f characters in length, f being a number between zero and infinity is generated. The generated random key and the string of random fill characters is concatenated to the encrypted plain text message to generate an encrypted message string. The encrypted message string has a length 2m+f. The encrypted message string is transmitted to a receiver.

Claims

1. A method of encrypting a plain text message that is m characters in length, the method comprising:

generating a one off random key having a length of m characters, the random key using a character set and modulus that is compatible with the plain text message;

performing a first substitution encryption of the plain text message using the generated random key;

generating a string of random fill characters that is f characters in length, f being a number from zero to infinity;

concatenating the generated random key and the string of random fill characters to the encrypted plain text message to generate an encrypted message string, wherein the encrypted message string has a length 2m+f;

performing one or more additional encryptions, selected from the set of substitution encryptions and transposition encryptions, on the encrypted message string to generate a final message string, wherein at least one of the one or more additional encryptions are performed using a first pseudorandom string having a length greater than 2m+f characters, and a subset of the first pseudorandom string having a length of at least 2m+f is selected from a position that is different from a first position of the first pseudorandom string; and

transmitting the final message string to a receiver.

2. The method of claim 1, wherein one or more second pseudorandom strings are used for the remaining ones of the one or more additional encryptions, each of the one or more second pseudorandom strings having a length of at least 2m+f characters.

3. The method of claim 2, wherein at least one of the one or more second pseudorandom strings has a length greater than 2m+f, and a subset of the second pseudorandom string having a length of at least 2m+f is selected from a position that is different from a first position of the second pseudorandom string, and wherein the selected subset is applied to the encrypted message string to perform at least one of the additional encryptions.

4. The method of claim 1, wherein a first additional encryption of the one or more additional encryptions is a second substitution encryption performed by applying the first pseudorandom string to the encrypted message string.

5. The method of claim 1, wherein at least one of the additional encryptions is a transposition encryption performed by sorting the first pseudorandom string against the encrypted message string.

6. A method of encrypting a plain text message that is m characters in length, including any end of message characters, the method comprising:

receiving a setting of two or more parameters, the parameters including a block size b and a plain text segment size p, wherein b is equal to or greater than 2*p;

dividing the plain text message into n segments, n being an integer greater than or equal to two, each segment associated with one of n blocks, n being equal to m/p if there is no remainder and equal to the integer quotient+1 if there is a remainder r, wherein in the case where there is a remainder, the last block of the n blocks contains the last r characters of the m character message, and wherein each of the blocks contains a sequential segment of the plain text message;

generating, for each of the n blocks, one-off strings of random characters, using a character set and modulus that is compatible with the plain text message;

performing a first substitution encryption on each of the n segments using characters from the random string associated with the block associated with the respective segment as an encryption key;

performing one or more additional encryptions, selected from the set of substitution encryptions and transposition encryptions on each of the n segments to create encrypted character strings, wherein at least one of the one or more additional encryptions are performed using a first pseudorandom string having a length greater than 2*p characters, and a subset of the first pseudorandom string having a length of at least 2*p is selected from a position that is different from a first position of the first pseudorandom string;

generating an encrypted message string by concatenating the encrypted character strings of the n blocks such that the encrypted message string is at least 2m characters in length; and

transmitting the encrypted message string to a receiver.

7. The method of claim 6, further comprising concatenating an additional block of random characters to the encrypted message string prior to transmitting, the block having a random length from 0 to (b−

1) characters.

8. The method of claim 7 further comprising:

providing a computer application for allowing a user to (i) change any of the two or more parameters, and (ii) generate a master key for each new set of parameters which may be sent to other users for use in decrypting the encrypted message string.

9. A method of encrypting a plain text message that is m characters in length, including any end of message characters, the method comprising:

dividing the plain text message into n segments, n being an integer greater than or equal to two, wherein each segment is associated with one of n blocks;

generating one off random strings for each of the n blocks, each random string having a length of at least the length of the plain text segment associated with that block, each of the random strings using a character set and modulus that is compatible with the plain text message;

performing a first substitution encryption on each of the n plain text segments using characters from the random string associated with the block associated with the respective plain text segment as an encryption key;

performing one or more additional encryptions, selected from the set of substitution encryptions and transposition encryptions on each of the n segments to create encrypted character strings, wherein at least one of the one or more additional encryptions are performed using a first pseudorandom string having a length greater than 2*(m/n) characters, and a subset of the first pseudorandom string having a length of at least 2*(m/n) is selected from a position that is different from a first position of the first pseudorandom string;

generating an encrypted message string by concatenating the encrypted character strings of the n blocks such that the encrypted message string is at least 2m characters in length; and

transmitting the encrypted message string to a receiver.

10. An encryption system comprising an algorithm and a plurality of parameter sets, wherein the encryption system produces an encrypted message from a plain text message having m characters by performing (i) a first substitution encryption of the plain text message with a one off random string, and (ii) one or more additional encryptions on the output of the first substitution encryption, the one or more additional encryptions determined by a selected one of the plurality of parameter sets, wherein at least one of the one or more additional encryptions are performed using a first pseudorandom string having a length greater than m characters, and a subset of the first pseudorandom string having a length of at least m is selected from a position that is different from a first position of the first pseudorandom string, the encrypted message containing all of the information needed to decrypt the encrypted message by a decryption system having the same parameter set, wherein the probability of subsequent encryptions of the same plain text message producing a different encrypted message depends on the parameter set used by the encryption system.

11. The encryption system of claim 10, wherein the parameter set is selected by a user.

12. An encryption method comprising:

receiving a plain text message;

segmenting the plain text message into a plurality of blocks, each block holding a predefined plurality of characters of the plain text message;

generating a unique one off random key for each of the plurality of blocks;

encrypting each of the plurality of blocks using the corresponding one off random key; and

performing one or more additional encryptions on each of the blocks using pseudorandom strings, each of the one or more additional encryptions being selected from the set of substitution encryptions and transposition encryptions, wherein at least one of the one or more additional encryptions are performed using a first pseudorandom string having a length greater than the number of characters in each of the plurality of blocks, and a subset of the first pseudorandom string having a length of at least the number of characters in each of the plurality of blocks is selected from a position that is different from a first position of the first pseudorandom string.

13. The encryption method of claim 12, further comprising:

providing a computer application for allowing a user to select an algorithm used for generating the pseudorandom strings.

14. The encryption method of claim 13, wherein the computer application includes a library of pseudorandom generators and the computer application is configured to allow the user to generate new algorithms using pseudorandom generators chosen from the library of pseudorandom generators.

15. The encryption method of claim 12, wherein each of the encrypted plurality of blocks includes the encrypted segment of the plain text message and one of the generated one off random keys, such that the one off random key in each block is not the one off random key which was used to encrypt the plain text in that block.

16. The encryption method of claim 12 further comprising:

providing a computer application for allowing a user to generate an algorithm profile, wherein the algorithm profile may be sent to other users for use in decrypting an encrypted message.