Score:0

Why do we need to use Asymmetric cryptography if Diffie-Hellman solves the key exchange problem of symmetric cryptography?

cn flag

I am new to cryptography and I cant get my head around this issue:

If symmetric cryptography is faster then asymmetric and given that Diffie-Hellman key exchange algorithm allows you to exchange keys safely why bother using Asymmetric cryptography if I can exchange symmetric keys safely ?

et flag
Asymmetric Encryption is used mostly only for Key Exchange. It's always Symmetric Encryption which is used to encrypt traffic once the key is exchanged.
Swashbuckler avatar
mc flag
DH "only" works when you're actively communicating with another party. There are many instances when that's not the case and a different mechanism is needed. Think about email encryption. Email is store and forward, so how do you encrypt the data there without using a preshared symmetric key?
SAI Peregrinus avatar
si flag
Static-ephemeral DH works just fine for email message encryption.
ezio avatar
cn flag
@user93353 so my guess was correct, thanks i appreciate the answer.
Score:2
si flag

Asymmetric Cryptography was the start of a new era in cryptography.

Diffie-Hellman key exchange is asymmetric cryptography.

We also use digital signature algorithms. These allow someone with a private key to digitally "sign" a message, such that anyone with the corresponding public key can verify that the signature was made on that message by that private key. This allows proving the authorship of messages and provides the non-repudiation. The non-repudiation is only possible with asymmetric cryptography and Rabin Signature Scheme was the first genuine digital signature.

Key exchange and digital signature schemes are the most common use of asymmetric cryptography.

Score:1
us flag

As mentioned in the comment by user93353, asymmetric cryptography is mostly used for symmetric key exchanging and signing of messages. I will give a simple explanation of the need for asymmetric cryptography.

Image a complete graph $G$ with $n$ nodes in which every node needs to communicate with each other. If we use symmetric encryption we need $O(n^2)$, a key for every edge. If we use asymmetric encryption we need $O(n)$ keys. As you can see symmetric encryption doesn't scale well. I have seen it in some cryptography textbooks referenced as The squaring problem. The simple solution to this one is whenever a node needs to communicate with another node to generate a shared symmetric secret key and use it for onward communication. This is what TLS does basically.

kelalaka avatar
in flag
$n^2$ is the shortening of the long problem. One needs a certificate to mitigate the MITM attack on DH. Similarly, you need the certificates for the signature verification, too...
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.