# Tag Info

0

Depending on resources available on nodes and whether you are going to implement anything yourself, racoon and ipsec could be a solution. It supports nodes with x.509 certificates issued by a local CA. Please note this question is not simple at all.

2

Key exchange is notoriously hard to get right, and I strongly recommend not to do your own (unless your security requirements are really minimal). For example, what you propose does not provide forward security, which is generally considered of great importance in key exchange protocols. The good news is that there is a paper doing exactly what you need; ...

0

This is basically the difference between e.g. the RSA_ ciphersuites and the DHE_/ECDHE_ ciphersuites in the TLS protocols. Currently the standardization moves towards ECDHE_ because it provides forward secrecy: even if you factor the RSA key you can still not decrypt previous transmissions. Note that you don't have to MAC the session key before encryption ...

2

When using symmetric encryption is it important to compress the data first? No, not really (unless you're concerned with bandwidth usage). On the other hand, compressing the message can leak data (for example, how compressible the data is). Could it be the case for some ciphers but not for others? No, or at least, not for any cipher that we would ...

0

The Wikipedia Article on Post Quantum Cryptography has the following to say about symmetric algorithm quantum resistance: Symmetric Key Quantum Resistance Provided one uses sufficiently large key sizes, the symmetric key cryptographic systems like AES and SNOW 3G are already resistant to attack by a quantum computer.[20] Further, key management ...

0

If you define your encryption to be $C=E_{62}(E_k(D_{62}(P)))$ and your decryption to be $P=E_{62}(D_k(D_{62}({C})))$ where $P$ is your encoded URL then you've brought back your problem to finding an encryption function for $l$ bits, where $l$ is the size of $D_{62}(P)$. After that you can "just" look for a Format Preserving Encryption primitive for those ...

Top 50 recent answers are included