/explore
|
You are here 
|
hardenedvault.net | ||
| | | | |
nfil.dev
|
|
| | | | | I've been reading up on the Double Ratchet algorithm and its implementations lately, as it's an exciting piece of crypto that offers some very nice guarantees: forward secrecy (ie. by breaking a key at some point you can't read older messages), eventual break-in recovery (ie. by breaking a key you can only read a few messages before the protocol recovers), and of course confidentiality and deniability. It's all done through the use of "ratchets", which are used to update the key used with each message. The algorithm comes at a nice time, when consumers are becoming more privacy-aware and governments more determined to perform mass surveillance, which is where E2E encryption becomes the only way to protect your data. | |
| | | | |
david.nepozitek.cz
|
|
| | | | | I've reversed-engineered the X Android app to find out whether it is as secure as claimed. It is not. | |
| | | | |
www.jeremykun.com
|
|
| | | | | Last time we saw the Diffie-Hellman key exchange protocol, and discussed the discrete logarithm problem and the related Diffie-Hellman problem, which form the foundation for the security of most protocols that use elliptic curves. Let's continue our journey to investigate some more protocols. Just as a reminder, the Python implementations of these protocols are not at all meant for practical use, but for learning purposes. We provide the code on this blog's Github page, but for the love of security don't actually use them. | |
| | | | |
davidgerard.co.uk
|
|
| | | Bitcoin ideology bought into the entire Federal Reserve conspiracy package from the start | ||
