A Novel Encryption Method Using Proof-of-Work and Unicode Scrambling
Abstract
This whitepaper presents a unique encryption method that combines user input, proof-of-work algorithms, and Unicode scrambling to ensure secure communication. The method involves generating a key from user input and proof-of-work, encoding plaintext into a printable format, scrambling the message, and converting it to a complex Unicode string. The decryption process reconstructs the original message without raising errors for incorrect keys.Introduction
In the digital age, secure communication is paramount. This encryption method leverages a combination of user input, proof-of-work, and Unicode scrambling to provide a robust encryption solution.Key Generation
User Input: A key is generated from a 12 to 20 character user input using 94 printable ASCII characters.
Proof-of-Work Algorithm: An additional input from a proof-of-work algorithm, which takes approximately one minute to run on a fast PC, is incorporated into the key generation process. See calculation on time taken to brute force this scheme below.
An external network control key mayalso be supplied at this stage.
Encoding Process
Plaintext Encoding: Each character, including Unicode, is encoded to a printable byte.
Message Scrambling: The message sequence is scrambled procedurally using each character in the generated key. a random amount of random characters are also added to defeat traffic analysis.
Alphabet Creation and Encoding:
Unicode Characters: 3000 Unicode characters are used to create 12 unique 16 character alphabets based on the key.
Random Alphabet Selection: For each character, an alphabet is selected at random, and the hex value is looked up as a Unicode character.
Output: The output is a complex string of Unicode characters.
Decoding Process
Alphabet Reconstruction: The 12 alphabets are reconstructed using the key.
/Hex Value Retrieval: The program finds the alphabet containing each character and reads off the hex value (signalled by position in the alphabet).
Message Unscrambling: The padding text is removed and t99he message sequence is unscrambled.
Plaintext Reconstruction: The original plaintext is reconstructed. Reinstating any special characters in original.
The program does not raise an error if the key is incorrect
It always produces printable characters as output.In that way an attacker can never know if he has been successful. Critical messages may have been pre-encrypted before transmission. A blockchain mechanism is used for secure key exchange.Conclusion
This encryption method offers a novel approach to secure communication by combining user input, proof-of-work, and Unicode scrambling. Future research could explore further optimizations.
Brute Force Key Attack Calculation
The time required to brute force a 12-character key, comprised of a choice of 94 characters that may be repeated, assuming the solution
is found halfway through the search and each attempt takes 39 seconds, is approximately
7.42×10^12 years.(7,420,000,000,000)
This demonstrates the significant robustness of the encryption method against brute force key attacks. Plus this is for the shortest key. a 20 character key would be likely to take 8 times longer.
Trying to work backwards from the message Is even worse. There are 1.29x10^42 possible combinations of possible alphabets.
