Post-Quantum Encrypter. AI and PQEncrypter

Computer Security After Quantum Computers

See AI comments about operational features of PQEncrypter

• 2048-bit symmetric key cryptographic algorithm.
  

  AI: This encrypter has very advanced features, but there are some points that are worth analyzing in more detail. 2048 bit is an extremely long symmetric key (normally, 256 bit is considered secure). If the algorithm can manage efficiently keys this size, the security against brute-force attacks would be immensely high.

  We, the developers: The algorithm's management with this keys size is very efficient. It requires few resources and get extraordinary speeds among 5 and 8MB/s for the encryption/decryption of files. Read further below.



• It generates a new random key, decipherable by the final recipient, in the encryption of each message, using the OTP technique considered indecipherable.
  

  AI: Generating a new key in every encryption session creates an additional new security layer which prevents attacks as the 'known text'.

  We, the developers: Encrypting repeatedly small variations of a 'known text' for making comparative analysis and discovering the algorithm's key is useless, given each encryption session uses a completely new key, breaking therefore the so far performed analysis.



• The range of possible keys for the algorithm is a huge number containing more than 500 digits.
  

  AI: If the key space is greater than 10500, means that even the most advanced computers, nor even Quantum Computers could not explore all possible key combinations.



• Easy to use and intuitive.
• Fast and efficient in the process of encrypting and decrypting files.
  

  AI: A 2048 bit key as a symmetric encryption is unusually great and could require a notable amount of resources to encrypt/decrypt tasks. While security is impressive, it remains to be seen whether the speed of encryption/decryption is viable for real-time applications.

  We, the developers: The algorithm requires very few resources on Disk or RAM to operate, given encrypted files are approximately the same size in MBytes as the original file. Moreover, in real conversion Encryption/Decryption speed tests, it was easily obtained speeds of 5 MBytes/s to 8 MBytes/s. Encrypting a file of 10 MBytes would only require from 1.25 to 2 seconds. The resources required by the algorithm are therefore fully optimized.



• It uses a message integrity and authenticity security procedure, not SHA-256, which detects alterations in a single bit throughout the encrypted file, regardless of its length.
  

  AI: If the integrity and authenticity are both well implemented, it ensures that encrypted data can not be altered without being previously detected.

  We, the developers: The algorithm will detect easily if the file has been manipulated, even in a minor way, that's to say, only in a single bit of its content. In this case, the system will then display a warning informing the user that the file has been manipulated. It does not use SHA-256 for this purpose.



• Encrypts all types of files. Text, graphics, images, audio, video, databases, PDFs, vectorials, etc.
  

  AI: This is a key feature in modern Cryptography, allowing to be used with several applications.



• Virtually unbreakable by brute-force mechanisms, not even in the essentially theoretical case of testing and verification at 10¹² keys per second, which leads to theoretical decryption times beyond the human scale. The same is true for rates of 10¹⁵ and 10¹⁸ keys per second.


• It is not based on primes' factorization of large numbers, which is mostly used in current encryption systems such as the RSA algorithm, a mechanism that is easily beaten by Quantum Computers through the application of the well-known Shor's Algorithm


• The application of Grover's Algorithm to the encrypting process made by PQEncrypter, is of little use in this case since the key initially used in the encrypted message is repeatedly altered, in fact thousands of times, throughout each ciphering session. Each of those new keys used internally belong also to 10⁵⁰⁰ keys space, so that the analysis through Grover's mechanism should be restarted anyway thousands of times, but in the very precise, concrete and unexpected moment PQEncrypter changes, thousands of times, to a new internal operation key. This represents an insurmountable complexity to decrypting messages processed by PQEncrypter.


• It far exceeds the ability of Quantum Computers to break the algorithm.
  Neither can it be done through computation with classical computers, whether very high-level computing, through 'clusters' of computers, or through the use of GPUs.


• It does not use working philosophies, currently under study, such as lattice-type structures or elliptic curves and discrete logarithms, but rather a different method of operation that surpasses the current Post-Quantum Cryptography (PQC) concept, given that it is completely immune to brute force attack, the only possible one, given the continuous changes in its entropy and internal structure throughout each encryption session, together with the huge range of possible keys of the algorithm.
  

  AI: Algorithm is not based on lattice mathematics, nor elliptic curves, nor discrete logarithms nor large prime numbers factorization, which is an interesting point. However, not knowing the exact mathematical base used by the algorithm, it is difficult to assess whether it really offers the promised security.

  We, the developers: The extraordinary security claimed for our algorithm is based on the Combinatorics, a well known branch of Mathematics with which can easily make precise calculations of existing combinations. Also, is one of the hardest and toughest discipline of Mathematics at the time of getting the right solution within a quasi-infinite combinations' space. In fact, the atoms in Universe are aproximately 1080. Our encrypter has more than 10500 possible solutions.

  
  

  According to Britannica: "One of the basic problems of Combinatorics is to determine the number of possible configurations (e.g., graphs, designs, arrays) of a given type. Even when the rules specifying the configuration are relatively simple, enumeration may sometimes present formidable difficulties. The mathematician may have to be content with finding an approximate answer or at least a good lower and upper bound". Keep in mind, PQEncrypter has more than 10500 potential solutions!!



• Available in a +Plus version that features three additional active layers of protection against attack attempts and violations of the message encrypted by the algorithm.

PQEncrypter, is a fully functional and operative Cryptographic Algorithm.

The above features have been verified through exhaustive performance analysis during its development.