搜索结果: 1-1 共查到“The hard problem”相关记录1条 . 查询时间(0.125 秒)
Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Hard Problem
Diophantine equation hard problem (DEHP) integer factorization problem asymmetric cryptography
2012/3/26
The Diophantine Equation Hard Problem (DEHP) is a potential cryptographic problem on the Diophantine equation $U=\sum \limits_{i=1}^n {V_i x_{i}}$. A proper implementation of DEHP would render an atta...