New answers tagged

-2

Without the value of both A and B, I guess a conclusive decision might not be possible. But, I think I've got a probablistic method that determines (B>=A)==true when the gap B-A is large enough, and determines (B>=A)==false when B<A or A and B are so close that the algorithm cannot give correct answer with enough confidence. The method has 4 ...


1

As an addition to the other answers: there are indeed multiple solutions available to you that do not rely on designing your own encryption-scheme and code. This is of importance as it is very easy to make mistakes on both the scheme and the implementation level. You might for example be able to take a certain (trusted) algorithm which should be safe and ...


2

As no particular attack scenario has been given I'd add another, more high level option. When point-to-point transport security isn't supposed to be secure enough then you might consider end-to-end message security or application level security as well. The idea of TLS is that it protects messages from client to server. However, the client and the server ...


3

Your idea lacks forward secrecy, which protocols like TLS often (in newer versions anyway) offer. Otherwise it is close to how such things are usually done. To get forward secrecy you would instead use an ephemeral Diffie-Hellman key exchange, which you would authenticate with the pre-shared public key (which would be a signing key, not an encryption key, ...



Top 50 recent answers are included