机构名称：
¥ 4.0
saGsfied: • P is a finite set of possible plaintexts • C is a finite set of possible ciphertexts • K , the keyspace , is a finite set of possible keys • E is a finite set of encrypGon funcGons • D is a finite set of decrypGon funcGons • ∀ K ∈ K EncrypGon Rule : ∃ e K ∈E和decrypgon规则：∃dk∈D使得（e k：p→c），（d k：c→p）和∀x∈P，d k（e k（x））= x。
经典密码学-CSE IITM
主要关键词
相关文件推荐
