For the same security, an elliptic curve algorithm (such as ECDSA) requires a smaller key length than RSA.
On the other hand, RSA has been used for a long time, everyone knows how to write Java code and process data. But strong RSA requires increasingly longer encryption keys.
In real commercial use of the RSA encryption algorithm, extremely high security can be achieved by using data obfuscation.
Here this is not the usual obfuscation of the code, but the transformation of the correct code into "wrong". When the decryption keys or ciphertext are deliberately corrupted and the decryption operation cannot be performed.
There can be a large number of processing options.
Two code for such processing will not be too big. For example - repositotry
public String ObfuscationD(String SourceText, String e, String d)
This is the easiest replacement option before encryption or after encryption.
There can be no universal and at the same time reliable methods of obfuscation. The programmer must each time create a new code with new parameters and a new algorithm for "corrupting" the source text.
Only then can we assume that your data is securely encrypted. If you are encrypting records in a database, you can use different obfuscation algorithms for each field in the record.
For hackers, this will not be the most pleasant surprise. But it is for this that your programmer can receive a large salary.
Open Source Java
Post a Comment