![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/en/thumb/b/b0/Double_Ratchet_Algorithm.png/640px-Double_Ratchet_Algorithm.png&w=640&q=50)
Double Ratchet Algorithm
Cryptographic key management algorithm / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Double Ratchet Algorithm?
Summarize this article for a 10 year old
In cryptography, the Double Ratchet Algorithm (previously referred to as the Axolotl Ratchet[2][3]) is a key management algorithm that was developed by Trevor Perrin and Moxie Marlinspike in 2013. It can be used as part of a cryptographic protocol to provide end-to-end encryption for instant messaging. After an initial key exchange it manages the ongoing renewal and maintenance of short-lived session keys. It combines a cryptographic so-called "ratchet" based on the Diffie–Hellman key exchange (DH) and a ratchet based on a key derivation function (KDF), such as a hash function, and is therefore called a double ratchet.
![Thumb image](http://upload.wikimedia.org/wikipedia/en/thumb/b/b0/Double_Ratchet_Algorithm.png/640px-Double_Ratchet_Algorithm.png)
The algorithm provides forward secrecy for messages, and implicit renegotiation of forward keys; properties for which the protocol is named.[4]