Random position cipher encryption using an aperiodic pseudo-random number generator

A method of decrypting ciphertext using a one or more Random Position Cipher (RPC) processors, comprising:

• selecting a current seed number from a secret key;
• constructing a current multiplier from the current seed number by selectively combining digits from the current seed number;
• generating by one or more hardware processors, a command to cause an Aperiodic Pseudo-Random Number Generator (APRNG) to create a sequence of pseudo random numbers, where pseudo-random numbers in the sequence of pseudo random numbers are configured to fall in a range of values from 0 to 255;
• selecting a current starting point, in the sequence of pseudo random numbers, from the secret key;
• resetting to a value of 0 and starting a first counter to count the pseudo-random numbers generated by the APRNG after the current starting point in the sequence of pseudo random numbers and until a value of the first counter equals a next character in the ciphertext;
• storing at a memory the pseudo-random number associated with the value of the current counter, where the stored pseudo-random number is an American Standard Code for Information Interchange (ASCII) code;
• repeating the previous two steps until all characters in the ciphertext have been associated with an ASCII) code;
• replacing the ASCII codes with characters associated with the ASCII codes;
• storing at the memory the characters associated with the ASCII codes, where the stored characters are plaintext characters;
• and
• outputting the plaintext characters;
• wherein the APRNG creating the sequence of pseudo-random numbers involves:
• creating a current seed number;
• generating a plurality of large pseudo-random numbers by (a) multiplying the current seed number with a current multiplier, and (b) setting (i) the current multiplier equal to a result of a random selection of digits of the current seed number and (ii) the current seed number equal to the large pseudo-random number;
• and
• splitting at least one large pseudo-random numbers of the plurality of large pseudo-random numbers into a sequence of pseudo-random numbers.

A computer program product including one or more computer readable mediums for encrypting plaintext, having instructions encoded thereon that, executed by a Random Position Cipher (CPR) encryption processor to:

• substitute a sequence of characters in a plaintext with American Standard Code for Information Interchange (ASCII) codes associated with the sequence of characters in the plaintext;
• generate a command to cause an Aperiodic Pseudo-Random Number Generator (APRNG) to create a sequence of pseudo random numbers, where pseudo-random numbers in the sequence of pseudo random numbers are configured to range from 0 to 255;
• select a current starting point in the sequence of pseudo random numbers;
• reset to a value of 0 and start a first counter to count the pseudo-random numbers generated by the APRNG after the current starting point in the sequence of pseudo random numbers and until a pseudo random number matches the ASCII code of a next character in the plaintext;
• store the first counter's value to a ciphertext in a memory module;
• repeat the previous two steps until all characters in the plaintext have been associated with a character in the ciphertext;
• construct a secret key;
• and
• output the ciphertext and the secret key;
• wherein the APRNG creating the sequence of pseudo-random numbers further comprises instructions to cause the APRNG to:
• create a current seed number;
• generate a plurality of large pseudo-random numbers by (a) multiplying the current seed number with a current multiplier, and (b) setting (i) the current multiplier equal to a result of a random selection of digits of the current seed number and (ii) the current seed number equal to the large pseudo-random number;
• and
• split at least one large pseudo-random number of the plurality of large pseudo-random numbers into a sequence of pseudo-random numbers.

A computer program product including one or more computer readable mediums for decrypting ciphertext, having instructions encoded thereon that, executed by a Random Position Cipher (CPR) decryption processor to:

• select a current seed number from a secret key;
• construct a current multiplier from the current seed number, by selectively combining digits from the current seed number;
• generate a command to cause an Aperiodic Pseudo-Random Number Generator (APRNG) to create a sequence of pseudo random numbers, where pseudo-random numbers in the sequence of pseudo random numbers are configured to fall in a range of values from 0 to 255;
• select a current starting point, in the sequence of pseudo random numbers, from the secret key;
• reset to a value of 0 and start a first counter to count the pseudo-random numbers generated by the APRNG after the current starting point in the sequence of pseudo random numbers and until a value of the first counter equals a next character in the ciphertext;
• store at a memory module the pseudo-random number associated with the value of the current counter, where the stored pseudo-random number is an American Standard Code for Information Interchange (ASCII) code;
• repeat the previous two steps until all characters in the ciphertext have been associated with an ASCII code;
• replace the ASCII codes with characters associated with the ASCII codes;
• store at the memory module the characters associated with the ASCII codes, where the stored characters are plaintext characters;
• and
• output the plaintext characters;
• wherein the APRNG creating the sequence of pseudo-random numbers further comprises instructions to cause the APRNG to:
• create a current seed number;
• generate a plurality of large pseudo-random numbers by (a) multiplying the current seed number with a current multiplier, and (b) setting (i) the current multiplier equal to a result of a random selection of digits of the current seed number and (ii) the current seed number equal to the large pseudo-random number;
• and
• split at least one large pseudo-random numbers of the plurality of large pseudo-random numbers into a sequence of pseudo-random numbers.

A computing apparatus for encrypting plaintext, the computing apparatus comprising:

• one or more hardware processors;
• a memory configured for storing a plurality of data;
• a computer clock;
• an Aperiodic Pseudo-Random Number Generator (APRNG);
• and
• a Random Position Cipher (RPC) processor configured to:
• substitute sequence of characters in a plaintext with American Standard Code for Information Interchange ASCII) codes associated with the sequence of characters in the plaintext;
• generate a command to cause the APRNG to create a sequence of pseudo random numbers, where pseudo-random numbers in the sequence of pseudo random numbers are configured to range from 0 to 255;
• select a current starting point in the sequence of pseudo random numbers;
• reset to a value of 0 and start a first counter to count the pseudo-random numbers generated by the APRNG after the current starting point in the sequence of pseudo random numbers and until a pseudo random number matches the ASCII code of a next character in the plaintext;
• store the first counter's value to a ciphertext in a memory;
• repeat the previous two steps until all characters in the plaintext have been associated with a character in the ciphertext;
• construct a secret key;
• and output the ciphertext and the secret key;
• where the APRNG creating the sequence of pseudo-random numbers is configured to:
• create a current seed number;
• generate a plurality of large pseudo-random numbers by (a) multiplying the current seed number with a current multiplier, (b) setting (i) the current multiplier equal to a result a random selection of digits of the current seed number and (ii) the current seed number equal to the large pseudo-random number;
• and
• split at least one large pseudo-random number of the plurality of large pseudo-random numbers into a sequence of pseudo-random numbers.

A computing apparatus for decrypting ciphertext, the computing apparatus comprising:

• one or more hardware processors;
• a memory configured for storing a plurality of data;
• a computer clock;
• an Aperiodic Pseudo-Random Number Generator (APRNG);
• and
• a Random Position Cipher (RPC) processor configured to:
• select a current seed number from a secret key;
• construct a current multiplier from the current seed number, by selectively combining digits from the current seed number;
• generate a command to cause an Aperiodic Pseudo-Random Number Generator (APRNG) to create a sequence of pseudo random numbers, where pseudo-random numbers in the sequence of pseudo random numbers are configured to fall in a range of values from 0 to 255;
• select a current starting point, in the sequence of pseudo random numbers, from the secret key;
• reset to a value of 0 and start a first counter to count the pseudo-random numbers generated by the APRNG after the current starting point in the sequence of pseudo random numbers and until a value of the first counter equals a next character in the ciphertext;
• store at a memory the pseudo-random number associated with the value of the current counter, where the stored pseudo-random number is an American Standard Code for Information Interchange (ASCII) code;
• repeat the previous two steps until all characters in the ciphertext have been associated with an ASCII code;
• replace the ASCII codes with characters associated with the ASCII codes;
• store at the memory the characters associated with the ASCII codes, where the stored characters are plaintext characters;
• and
• output the plaintext characters;
• where the APRNG creating the sequence of pseudo-random numbers is configured to:
• create a current seed number;
• generate a plurality of large pseudo-random numbers by (a) multiplying the current seed number with a current multiplier, (b) setting (i) the current multiplier equal to a result of a random selection of digits of the current seed number and (ii) the current seed number equal to the large pseudo-random number;
• and
• split at least one large pseudo-random numbers of the plurality of large pseudo-random numbers into a sequence of pseudo-random numbers.