Post-Quantum Encrypter. The PQEncrypter Features.
Computer Security After Quantum Computers
The recent development of Quantum Computers represents a breach in the Cybersecurity of the data we use, travel through, and store via computing systems.
Our PQEncrypter has been specifically designed to far exceed the capabilities of Quantum Computers in breaking current encryption systems.
It also cannot be defeated by classical computers, as PQEncrypter is completely immune to brute-force attacks nor made by modern Cryptanalysis techniques.
Neither of these computer systems are capable of decrypting documents generated by our powerful algorithm.
- 2048-bit symmetric key cryptographic algorithm.
- It generates a new random key, decipherable by the final recipient, in the encryption of each document, using the OTP technique considered indecipherable.
- The range of possible keys for the algorithm is a huge number containing more than 500 digits.
- Easy to use and intuitive.
- Fast and efficient in the process of encrypting and decrypting files.
- It uses a document integrity and authenticity security procedure, not made by SHA-256, but with our own author's procedure, which detects alteration in a single bit throughout the encrypted file, regardless of its length.
- Encrypts all types of files. Text, graphics, images, audio, video, databases, PDFs, vectorials, etc.
- Virtually unbreakable by brute-force mechanisms, not even in the essentially theoretical case of testing and verification at 1012
keys per second, which leads to theoretical decryption times beyond the human scale. The same is true for rates of 1015 and 1018 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 document is repeatedly altered, in fact thousands of times, throughout each ciphering session.
Each of those new keys used internally belong also to 10500 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 documents 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' or grouping 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.
- Available in a +Plus version that features three additional active layers of protection against attack attempts and violations of the documents 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.
|
more information:
|