Abstract: The present innovative solution increases security to interceptor attacks while not significantly minimizing the processing resource and time requirements of cryptography processes that are used. A novel RPC is used in conjunction with a public key, used to create private keys, for scrambling ASCII dictionary strings, which are then used to calculate distances among characters in the scrambled dictionary. The end result of the encryption process is not a ciphertext string but, instead, it is a string of character distances that any interceptor cannot use since he cannot recreate the scrambled dictionary or deduce what distances represent. The encryption process is simplified by converting computationally intensive operations into simple lookup operations in position strings calculated once for each scrambled dictionary. During decryption the scrambled dictionary and the matching position string are recreated and the original plaintext is recovered by simple lookup operations.

Abstract: The present innovative solution increases security to interceptor attacks and loss of cipher-characters, while not negatively impacting the processing resource and time requirements of cryptography processes. A novel Synchronous and Self-Synchronous Random Position Cipher (RPC) with arbitrary length key cryptography methodology and apparatus are presented which are based on a novel Aperiodic Pseudo-Random Number Generator (APRNG) using large seed numbers. The RPC does not replace plaintext characters with encryption characters but with the number of pseudo-random numbers that need to be generated by the APRNG to match the ASCII codes of the characters in the plaintext. Decryption uses the number of pseudo-random numbers that need to be generated by the APRNG to match the ASCII codes of the plaintext characters.

Abstract: The present innovative solution solves the problem of generating pseudo-random numbers that have practically infinite period, while requiring limited processing resources and operating significantly faster that known pseudo-random number generators. A sequence of big pseudo-random numbers is created using a large seed number calculated as the product of three large constants entered by a user or fed by a computer clock. The big pseudo-random numbers are then selectively split into a sequence of aperiodic pseudo-random numbers which are then output for use in any suitable application and for seeding the present generator.

Abstract: The present innovative solution solves the problem of generating pseudo-random numbers that have practically infinite period, while requiring limited processing resources and operating significantly faster that known pseudo-random number generators. A sequence of pseudo-random numbers is created by a linear congruential generator using a large seed number and the sequence is used to create a big number. The big number is formed by raising each of at least two pseudo-random numbers and their sum to the same power. The big number is then selectively split into a sequence of aperiodic pseudo-random numbers which are output for use in any suitable application and for seeding the present generator.

Abstract: Techniques for compressing binary input data streams and files by reducing entropy of the input data prior to compression. Entropy reduction is achieved by first getting a stream of single-digit decimal pseudo random numbers and calculating the frequency of occurrence of each decimal number in the even and odd positions of the pseudo random number stream. Subsets of the frequencies of occurrence of the decimal digits are selected to best match the frequency of occurrence of “0” and “1” in the odd and even positions of the binary input data stream. The decimal digits of the subsets of frequencies of occurrence are selectively set to “0” or “1” thereby creating a binary pseudo random number (i.e. mapping) stream, which is XORed with the binary input stream and compressed. Decompression uses the same pseudo random number stream using the mapping stream and the seed number used during compression.