Method and system for performing secure electronic messaging
First Claim
1. A method for encrypting a message comprising the steps of:
- a) calculating a numerical value corresponding to each digit of a source key by using said each digit of the source key as an input variable to one of a first plurality of formulae, thereby creating a message key;
b) selecting said one of the first plurality of formulae in step a) based on a corresponding digit of a random key; and
c) distributing an alphabet of characters throughout a predetermined matrix for each individual message based on the message key by;
(i) determining an order fill pattern for the alphabet;
(ii) determining a start position of an alphabet fill in the matrix from two predetermined digits of the message key;
(iii) determining a start position of a blank fill from two additional predetermined digits of the message key;
(iv) determining a blank separation value from two more predetermined digits of the message key;
(v) determining a blank grouping value from two further predetermined digits of the message key;
(vi) designating a plurality of blank positions in the matrix starting at a position in the matrix equal to a modular sum of the start position of the alphabet fill plus the start position of the blank fill, continuing for a number of positions in the matrix equal to the blank grouping value, and then skipping a number of positions in the matrix equal to the blank grouping value; and
(vii) distributing the alphabet in the matrix by starting at the start position of the alphabet fill and filling all positions not designated as blank positions according to the order fill pattern.
9 Assignments
0 Petitions
Accused Products
Abstract
A secure electronic messaging system (SEMS) provides absolute system security and user-defined message security for electronic messaging between two public entities. These messages can be of any kind provided the contents are created using a defined master alphabet of 81 characters or less. The SEMS encrypts and decrypts source message data using a series of message keys that are derived from a private, numeric original key known only by both parties sending and receiving messages. The message key suite absolutely secures the original key from discovery. The secure distribution of these original keys will be under the same methods that the public entities would use to discover each other such as opening an account, making a public inquiry for membership, etc. The system is based on the simple mathematics for secure electronic monetary transactions that translates source numbers into encrypted cipher numbers. The SEMS translates message content characters into numbers based on a message key suite dependent distribution of the master alphabet and then uses a series of equations to encrypt the numbers. The formulas return every possible number value, except the input value, and are completely dependent on the message key suite. Because there are no hidden parts, the architecture of the SEMS is completely available to anyone in the public sector. This openness makes attempting message decryption worthless. The only way to break an individual message is to attempt all user-defined message key possibilities, and even if successful, the original key can not be derived or discovered. The only way to get the key is to physically steal it; which is the constant risk entailed in secure messaging. The total openness and absolute security delivered by the SEMS is what is missing in all other available secure messaging schemes, and it is what is required by the public to have complete confidence in electronic messaging and commerce.
-
Citations
37 Claims
-
1. A method for encrypting a message comprising the steps of:
-
a) calculating a numerical value corresponding to each digit of a source key by using said each digit of the source key as an input variable to one of a first plurality of formulae, thereby creating a message key; b) selecting said one of the first plurality of formulae in step a) based on a corresponding digit of a random key; and c) distributing an alphabet of characters throughout a predetermined matrix for each individual message based on the message key by; (i) determining an order fill pattern for the alphabet; (ii) determining a start position of an alphabet fill in the matrix from two predetermined digits of the message key; (iii) determining a start position of a blank fill from two additional predetermined digits of the message key; (iv) determining a blank separation value from two more predetermined digits of the message key; (v) determining a blank grouping value from two further predetermined digits of the message key; (vi) designating a plurality of blank positions in the matrix starting at a position in the matrix equal to a modular sum of the start position of the alphabet fill plus the start position of the blank fill, continuing for a number of positions in the matrix equal to the blank grouping value, and then skipping a number of positions in the matrix equal to the blank grouping value; and (vii) distributing the alphabet in the matrix by starting at the start position of the alphabet fill and filling all positions not designated as blank positions according to the order fill pattern.
-
-
2. A method for encrypting a message comprising the steps of:
-
a) calculating a numerical value corresponding to each digit of a source key by using said each digit of the source key as an input variable to one of a first plurality of formulae, thereby creating a message key; b) selecting said one of the first plurality of formulae in step a) based on a corresponding digit of a random key; c) distributing an alphabet of characters throughout a predetermined matrix for each individual message based on the message key; d) calculating a numerical value corresponding to each digit of the source key by using said each digit of the source key as an input variable to one of a second plurality of formulae, thereby creating the random key; and e) selecting said one of the second plurality of formulae in step d) based on a second digit of the source key that is cyclically offset from said each digit in step d) in accordance with a random number. - View Dependent Claims (3, 16, 17, 18)
-
-
4. A method for encrypting a message comprising the steps of:
-
a) calculating a numerical value corresponding to each digit of a source key by using said each digit of the source key as an input variable to one of a first plurality of formulae, thereby creating a message key; b) selecting said one of the first plurality of formulae in step a) based on a corresponding digit of a random key; c) distributing an alphabet of characters throughout a predetermined matrix for each individual message based on the message key; d) calculating a numerical value corresponding to each character of the message by cyclically using a corresponding digit of the message key as an input variable to one of a second plurality of formulae, thereby creating an encrypted message; and e) selecting said one of the second plurality of formulae based on a location in the matrix in which said each character in step d) is stored. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14, 15)
-
-
5. A method for encrypting a message comprising the steps of:
-
a) calculating a numerical value corresponding to each digit of a source key by using said each digit of the source key as an input variable to one of a first plurality of formulae, thereby creating a message key; b) selecting said one of the first plurality of formulae in step a) based on a corresponding digit of a random key; c) distributing an alphabet of characters throughout a predetermined matrix for each individual message based on the message key d) calculating two numerical values corresponding to each character of the message by cyclically using two corresponding digits of the message key as input variables to a first one of a second plurality of formulae and a second one of said second plurality of formulae, respectively, thereby creating an encrypted message; e) selecting said first one of the second plurality of formulae based on a column in the matrix in which said each character in step d) is stored; and f) selecting said second one of the second plurality of formulae based on a row in the matrix in which said each character in step d) is stored.
-
-
6. A method for encrypting a message comprising the steps of:
-
a) calculating a numerical value corresponding to each digit of a source key by using said each digit of the source key as an input variable to one of a first plurality of formulae, thereby creating a message key; b) selecting said one of the first plurality of formulae in step a) based on a corresponding digit of a random key; c) distributing an alphabet of characters throughout a predetermined matrix for each individual message based on the message key; d) modular summing pairs of digits of an original key according to a random number assignment of the pairs of digits of the original key to produce said source key, which has a length less than that of the original key. - View Dependent Claims (7)
-
-
19. A secure electronic messaging system comprising the steps of:
-
a) assigning to two distinct public entities, two identical original symmetric numeric keys of length n where n is an even number and of set length so that 1×
10n/2 is a substantial and agreed upon number;b) using a random number to assign and sum the digits of the original key by a formula that produces a source key one half a length of the original key; c) using a formula to assign and sum the digits of the original key as they appear in order in pairs to produce a base source key that is one half the length of the original key; d) using a first plurality of formulae and the base source key to encrypt the random number and add a resulting encrypted random number to a message contents; e) using a first formula to sum a plurality of digits of the source key to generate a random key; f) using a second plurality of formulae to generate a unique and individual message key from the random key and the source key; g) distributing up to an 81 character master alphabet into a 9 by 9 segment matrix uniquely for each individual message based on the message key; h) distributing an offset of a plurality of false characters uniquely for each message based on the source key and adding these to the message contents; i) encrypting the original message while distributing interspersed false characters by using a third plurality of formulae and based on the message and source keys; j) using a second formula to create a message signature that is completely unique and individual for each message that authenticates both the sender and the content of the message as genuine; k) encrypting the message signature by a fourth plurality of formulae and adding it to the message contents; and l) formatting for open public transmission a resulting total encrypted message including the encrypted random number, the false character offset, the message content with interspersed false characters and the message signature to be plain ASCII text consisting of two strings of numbers separated by a carriage return and line feed.
-
-
20. A method for decrypting an encrypted message comprising the steps of:
-
a) using a message key to uniquely distribute an alphabet into a matrix for the encrypted message; b) determining a location value of a character in the matrix by using a digit of the message key as an input variable to a first plurality of formulae, and using a corresponding digit of the encrypted message as a return value of the first plurality of formulae, thereby identifying which one of the first plurality of formulae was used to generate the corresponding digit of the encrypted message, wherein a numerical order of said one of the first plurality of formulae represents said location value; and c) outputting a character in the matrix at said location value determined in said step b), thereby outputting a decrypted message. - View Dependent Claims (21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37)
-
Specification