| 摘要 |
Daniel (alternatively written as DNL) is a cryptographic paradigm, featuring ease of matching many plaintexts of choice to any given cipher (the deniability property). Consequently, the cipher itself cannot betray the specific plaintext that generated it, as it is "lost" in the large list of candidate plaintexts, all of which are decryption-generated from the the ciphertext. |
