Brute-force resistant encryption method

Abstract

The present invention relates to a novel method for protecting encrypted information against decryption attempts by quantum artificial intelligence. The invention is based on the prior modification of the encrypted information so that a decryption attempt results in an incorrect solution or that several decryption attempts result in solutions plausible to quantum artificial intelligence. Thus, even the most powerful artificial intelligence, even one powered by quantum computing, can generate either an incorrect solution or a large number of plausible solutions without being able to determine which one is correct. The method described in the present invention represents a significant advance in the field of encryption, rendering data impenetrable to decryption attempts by the most sophisticated quantum artificial intelligence systems. Abstract figure: Fig. 1

Description

Title of the invention: Brute force resistant encryption method Technical field

[0001] The invention is a means of securing a set of data which resists attempts at decryption using brute force techniques. Prior art

[0002] Widely used encryption algorithms such as RSA and elliptic curve cryptography (ECC) are known, which quantum computers could potentially break, making digital identities vulnerable to theft, fraud and exploitation, and more generally putting virtually all Internet security at risk. Technical problem

[0003] The importance of identification will only increase with the advent of quantum computing and advances in artificial intelligence, which will make it possible to find all encryption keys in a very short time, using brute force attacks.

[0004] Various solutions are being studied, such as replacing cryptography algorithms with quantum-resistant algorithms, improving key lengths, or using post-quantum cryptography, but the transition to these methods may take time.

[0005] The only method known and practiced today against brute force consists of limiting the number of decryption attempts for documents encrypted by a person, which reinforces the interest in methods of strong identification of people.

[0006] The objective of the present invention is to resist attempts to decrypt files by brute force. Brief description of the drawings

[0007] The invention will be well understood, and other aims, advantages and characteristics thereof will appear more clearly on reading the description which follows, which is illustrated by [Fig.l].

[0008] [Fig.l] is a diagram showing a procedure for reading and verifying a digital file protected by a method according to the invention. The receiver reads the message called message-signifier which is a signed barcode containing the address of a digital file called encrypted-file on a data server and an integrity control element of this encrypted-file. It verifies this barcode by its electronic signature by contacting if necessary a signature server, and then transmits the address of the encrypted file to the data server containing it. In return, it receives the decrypted digital file that the data server obtained by combining the encrypted file and the meaningful message, and verifies it using an integrity control element. Statement of the invention

[0009] The invention is a method for encrypting a data set called an original data set comprising the following steps: 1. modify by an algorithm called a modification algorithm all or part of said original data set to obtain a file called an encrypted file, such modifications being able to include deletions of data, and optionally encryption by a conventional method, 2. calculate a message called a signifying message containing the indication of a means of decrypting said encrypted file, this means comprising an algorithm called a decryption algorithm, characterized in that: 1. the modification made by said modification algorithm is such that a plurality of decryption attempts made without said decryption algorithm result in an incorrect solution or in different plausible solutions, 2. and that the said message-signifier makes it possible to determine the validity or invalidity of a solution obtained by an attempt at deciphering. Detailed description of the invention

[0010] Decrypting an encrypted file by the brute force method consists of imagining a very large number of decryption keys and trying to decrypt the file in question by numerous successive attempts made with each of these imagined decryption keys.

[0011] Decryption is considered successful when a plausible solution has been obtained, for example an identity photograph if it is such an encrypted photo, or the text of a contract if it is a contract.

[0012] If the decryption results in an incorrect solution, it is a failure.

[0013] If it results in a plurality of plausible solutions, the best quantum artificial intelligence cannot determine which is the correct solution.

[0014] The present invention is based on the principle of carrying out a prior modification of the encrypted information such that a decryption attempt results in an incorrect or simply different solution, or that several decryption attempts result in plausible solutions between which the decryption method cannot choose which is the correct one.

[0015] A modification may for example be a simple modification of the texture of a part of an image, or the addition of a detail to a text, such that one can differentiate between the original data set and a modified version. The present invention serves in this case not to make an encrypted text incomprehensible but to differentiate between an original data set and the same set that has been duplicated by preventing brute force from finding the original data set in its original form.

[0016] In the case where a modification is a deletion of information, the attempt at decryption consists of trying to replace the deleted parts with imagined information allowing plausible solutions to be reached, and we find ourselves in the same case as in that of a modification which is not a deletion of information, in the sense that brute force seeks numerous solutions allowing the original data set to be found.

[0017] Advantageously, more than a hundred decryption attempts should result in different plausible solutions, but an improved version of the present method can also be such that several thousand decryption attempts result in different plausible solutions.

[0018] A modification of information is preferably reversible, so that one can, from the encrypted file, recalculate the original data set.

[0019] For maximum efficiency, the modification of the original data set made by said modification algorithm concerns data essential to the use of the original data set considered, that is to say data without which the original data set is no longer useful for the desired objective. It is advantageous to use artificial intelligence to determine what type of data set it is and consequently determine what modifications to make to it.

[0020] In a preferred version, the modification algorithm comprises in the first step the analysis of all or part of the original data set to define in a second step what said modifications are to be made to it to make it unintelligible and so that several decryption attempts result either in an incorrect solution or in a plurality of plausible solutions. Such an operation is advantageously carried out by an artificial intelligence specially trained for this.

[0021] Here are some examples: 1- in the case where the original data set is the description of a security marking characterized by a series of characteristic pixels of color, and / or brightness, and / or light reflection varying depending on the point of view, the modification algorithm can be very simple since any modification or deletion of data is essential, and any solution can be plausible; 2- in the case where the original data set is a descriptive file of an object or a person, the modification algorithm advantageously includes the modification or deletion of dimensional values ​​of the object or person considered; 3- in the case where the original data set includes an illustration such as a drawing, a photograph or a video of an object or a person, the modification algorithm advantageously includes deformations or deletions of all or parts of the illustration considered; 4- in the case where the original data set includes a text such as the description of a method or a device, a contract, an order, a report, a press article, the modification algorithm advantageously includes modifications or deletions of mentions essential to the interpretation or understanding of the text considered.

[0022] In the case where the original data set is a key controlling access to a physical or digital domain, a solution is advantageously considered plausible as long as it opens access, even if the domain is not the right one.

[0023] It is advantageous if the physical or digital domains to which access can be given by brute force resemble those to which the original data set gives access so that the corresponding solutions are considered plausible.

[0024] A single encrypted file can be combined with several different significant messages. In combination with a single encrypted file, different so-called secondary significant messages can, for example, produce an identity card or passport, a visa, a driving license, a social security card, a disability certificate, a work stoppage certificate, an insurance certificate, a power of attorney, a membership card, an invitation, a train ticket, a payment card, etc.

[0025] It is advantageous that a so-called primary message-signifier, for example issued by a public authority or a trusted third party, can be used by third parties such as banks, transport companies, event organizers, administrations and private companies and even individuals to generate such secondary message-signifiers.

[0026] To enable the transmission of secondary signifying messages, it is advantageous for the so-called primary signifying message that enabled their generation to include a part that is easily identified as having to be reproduced in a secondary signifying message so that the latter can be combined with the encrypted file associated with the primary signifying message, or for it to include a reference with which to associate the secondary signifying message.

[0027] The decryption algorithm is advantageously provided with an algorithm reference and the message-signifier includes a means of obtaining it, for example its reference in a database.

[0028] It is desirable that the means for obtaining the decryption algorithm be provided to a person or computer responsible for decryption only after verification that the person or computer is indeed authorized to decrypt the original data set.

[0029] Strong identification is therefore desirable. It makes it possible, on the one hand, to determine which part of the population or computers can decipher the unintelligible message, but also to limit the number of successive attempts to decipher the unintelligible message, which would not be possible without strong identification, since a fraudster could use several different identities, for example several IP addresses, to carry out a large number of successive attempts in a limited time.

[0030] The message-signifier and the encrypted file are advantageously each and / or the other provided with a means of controlling their own integrity, such as a hash, a checksum for example, and / or a digital signature making it possible to authenticate their author and to guarantee their non-repudiation.

[0031] The signifying message and the encrypted file may each be provided with such control means relating respectively to the encrypted file and the signifying message.

[0032] The meaningful message may take the form of a character string, a barcode, or an internet link. It may include references or links to the encrypted file, including multiple links to separate parts of that file that may be posted at different addresses.

[0033] The encrypted file must not contain any information that would allow it to be linked to a meaningful message.

[0034] An additional means of security can be the opposite of not including any reference or link allowing the encrypted file to be found.

[0035] A secure implementation can therefore be to send to the person authorized to decrypt the encrypted file these three elements: the unintelligible file, the meaningful message, and the means of accessing the unintelligible file separately, by different means of communication, and without any of these three elements allowing it to be brought closer to one or the other of the other two.

[0036] In the application to the identification of persons, it is for example recommended to send to the holder of a digital identity the encrypted file comprising data rendered unintelligible from his biometric characteristics either by an Internet link allowing it to be downloaded, or by an email, and to send the significant message by text message or by post or even by hand delivery.

[0037] The meaningful message may also contain non-confidential information in clear, advantageously signed, such as the title of the protected information or some of its characteristics. This makes it possible to sign and communicate identities or certificates to third parties, who can, if necessary, obtain additional information, such as an identity photo or a certified copy of a contract, by submitting the message-signifier to the competent server.

[0038] In a more secure version, the file decryption can only be performed by a secure computer. The decryption algorithms can then remain secret.

[0039] In this more secure mode of implementation, the meaningful message or the encrypted file is advantageously kept confidential by a secure computer, which uses it to combine it respectively with the encrypted file or the meaningful message as the case may be.

[0040] In an even more secure version, the result of the combination of the encrypted file and the meaningful message is also kept secret by the secure computer. This prevents the original data set from being disseminated. The user simply has to send what he thinks is the original data set, or what this data set represents, so that the secure computer can respond yes or no to whether what he has sent is authentic or not.

[0041] Except when it is only a matter of issuing original data sets to reconstruct a file that is not very secret, such as an identity photo, which the main objective is to prevent from being used to create databases allowing unauthorized persons to perform facial recognition, this more secure implementation is especially recommended for the protection of other biometric characteristics such as fingerprints or DNA signatures, or for highly confidential documents.

[0042] It is recommended to ensure that original data sets of the same nature, or stored in similar or neighboring databases, are modified in a consistent manner, such as all original data sets corresponding to the same medical record.

[0043] The present invention is also a set of data protected by an encryption method according to one of the methods described above.

[0044] It is also a method of decryption described above of such a data set Applications

[0045] The methods described above apply to all types of files requiring confidentiality. They can be applied to all forms of files representing images, music, videos, software, graphics, engineering plans, texts such as medical prescriptions, examination reports medical, expert reports, contracts, payment orders, etc.

[0046] The main applications are - digital identity, the holder of which may only keep a signed meaningful message, in printed or electronic form, to identify himself, - medical prescriptions, certificates and attestations of all kinds, contracts, purchase orders, invoices, etc. which can be easily authenticated by their recipients, - music or video on demand services, newspapers and magazines, video games, means of controlling connected objects, - and generally the securing of any type of large or sensitive data.

Claims

Claims

1. Method for encrypting a set of data comprising the following steps:

1. modifying by an algorithm called a modification algorithm all or part of said set of data to obtain a file called an encrypted file, such modifications possibly including deletions of data, and optionally encryption by a conventional method, 2. calculating a message called a signifying message containing the indication of a means of decrypting said encrypted file, this means comprising an algorithm called a decryption algorithm, characterized in that:

1. the modification carried out by said modification algorithm is such that a plurality of decryption attempts carried out without having said decryption algorithm result in an incorrect solution or different plausible solutions, 2. and that said signifying message makes it possible to determine the validity or invalidity of a solution obtained by a decryption attempt.

2. Encryption method according to claim 1 characterized in that more than a hundred decryption attempts result in different plausible solutions.

3. Encryption method according to claim 1 or claim 2 characterized in that said modification algorithm relates to data essential to the use of said data set.

4. Encryption method according to any one of the preceding claims, characterized in that said modification algorithm comprises in a first step the analysis of all or part of said data set to define in a second step what said modifications are to be made to it to make it unintelligible.

5. Encryption method according to claim 3 or claim 4 characterized in that: - in the case where said data set is a descriptive file of an object or a person, said modification algorithm comprises the modification or deletion of dimensional dimensions of said object or said person, - in the case where said data set comprises an illustration such as a drawing, a photograph or a video of an object or a person, said modification algorithm comprises deformations or deletions of all or parts of said illustration, - and in the case where said data set includes text such as the description of a method or device, a contract, an order, a report, a press article, said modification algorithm includes modifications or deletions of information essential to the interpretation or understanding of said text.

6. Encryption method according to any one of the preceding claims, characterized in that said message-signifier comprises a part easily identified as having to be reproduced in a so-called secondary message-signifier so that the latter can be combined with the encrypted file associated with this first message-signifier.

7. Encryption method according to any one of the preceding claims, characterized in that the means for decrypting said encrypted file is only provided to a person or computer responsible for decryption after verification that said person or computer is authorized to decrypt the data set.

8. Method according to any one of the preceding claims, characterized in that the decryption of the encrypted file can only be carried out by a secure computer.

9. Method according to claim 11 characterized in that the result of the combination of the encrypted file and the significant message is also kept secret by the secure computer.

10. A data set protected by an encryption method according to any one of the preceding claims.

Images