Collaborate Disseminate
My organization within my company uses this KEX Algorithm in our SSH Implementation.
Another organization within my company won’t connect to our servers as long as this algorithm is implemented as they claim it is “weak and vulnerable”. … Continue reading ECDH_SHA2_NISTP256 (KEX) Algorithm in SSH – Vulnerabilities?
I’ve been searching high and low, trying to find a easily digestible protocol flow of SSH v2.
Does anyone have any docs or, could someone give me an example flow?
I’m interested in the flow of the public key exchange, things like:
After looking into how TLS handshaking works it seems to inherently include the Diffie Hellman algorithm during the point where they generate a shared secret key. However as I look into this some more I find articles such as this: https:/… Continue reading Is there an actually an alternative to using Diffie Hellman in TLS handshake? [migrated]
I am currently learning about the Diffie-Helman key exchange. I understand that for a g of 1, you’re resulting key would always end up as one which would obviously not be secure. However, I read that a p – 1 value for g is not secure but i… Continue reading For Diffie-Helman, why is a g value of p − 1 not a suitable choice? [migrated]
I am trying to understand https, as I understand https uses the Diffie–Hellman method for keys exchange and then AES for encryption.
But Diffie–Hellman needs two prime numbers, where do these come from?
Continue reading Diffie-Hellman in Https: How are prime numbers picked? [migrated]
Wikipedia states that Perfect Forward Secrecy “is a feature of specific key agreement protocols that gives assurances that session keys will not be compromised even if the private key of the server is compromised”.
In the example on Wikip… Continue reading In which sense is Perfect Forward Secrecy perfect? [duplicate]
In a TLS handshake using DH to negotiate a session key, a prime number on both sides must exist. Calculating a prime number large enough to be secure takes a litte computational time.
When does chrome generate this number?
Continue reading When does chrome generate the prime number for TLS communication?
Diffie-Hellman algorithm can not provide secure communication, but how can it provide secret key exchange?
In general, if Alice want to communicate to Bob by symmetric key, Alice can get Bob’s public key and encrypt the symm… Continue reading Why Diffie-Hellman algorithm can provide secret key exchange? [migrated]
I have almost 0 knowledge of IoT, their protocols and usual device constraints. I had a discussion today with someone that has a fair amount of IoT experience and we were discussing some security related issues and the establ… Continue reading Using Diffie-Hellman exchange on low power IoT devices
Why does the Diffie-Hellman algorithm have the perfect forward secrecy?