There’s a server, a client, and a hacker in a network. For encryption, the client and the server need to share their private keys. Wouldn’t the hacker be able to grab those during their transmission and decrypt further messages as they please?
There’s a server, a client, and a hacker in a network. For encryption, the client and the server need to share their private keys. Wouldn’t the hacker be able to grab those during their transmission and decrypt further messages as they please?
This is the video that finally explained it in a way that I totally understood.
TLDW: the actual key exchange works by using massive exponents that are very fast to run to get a result, but very hard to use that result to get the exponent you started with
Adding on to your TLDR: There’s also asymmetric cryptography based on elliptic curves, so it’s not always an exponent of two massive primes.
Even of isogenies of elliptic curves