New answers tagged key-exchange
Asymmetric Cryptography There are two different parts to creating a TLS session. There is the asymmetric cryptography, portion which is an exchange of public keys between two points. Which is what you saw in your Alice and Bob example. This only allows the exchange of asymmetric keys for asymmetric encryption/decryption. This is the ECDHE portion. The ...
You're right that ECDHE is being used for the key exchange and RSA is being used for verifying the server's identity. However, what are you going to do with the exchanged key? You'll need to use a certain algorithm to encrypt/decrypt communication with use of that exchanged key. 128-bits AES is used in this case, in GCM mode. Normally the hashing ...
The encrypion is between Mobile station and BTS, not between two Mobile Station, the encryption will be only between A and B, where A is your phone and B your BTS.
Your benchmark is possibly incomplete. I have a server which features a CPU reported as: "Intel(R) Xeon(R) CPU E3-1220 V2 @ 3.10GHz". It has four cores. On that machine, OpenSSL 1.0.1f reports (with openssl speed ecdhp224) that it can perform 9096 ECDH instances per second, using the NIST P-224 curve (a fine curve, of security rated at "112 bits", comparable ...
It will take a long time doing useless computation. One could conceivably use a designated-verifier non-interactive computationally zero-knowledge argument that the rest of the message is well-formed. More usefully, use proofs of work and PKE with fast decryption.
Constructing elliptic curves is computationally more expensive than choosing DH parameters. Constructing an elliptic curve is not a trivial task. I would recommend taking a look at the following question and the responses: Can custom elliptic curves be used in common TLS implementations?. As is mentioned in that thread, you are likely to run into ...
Top 50 recent answers are included