基于丢番图方程困难问题的非对称密码系统的安全性
Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Hard Problem
摘要:
丢番图方程困难问题(DEHP)是丢番图方程$U=\sum \limits_{i=1}^n {V_i x_{i}}$上的一个潜在密码学问题。DEHP的适当实现将使攻击者在指数级的许多解决方案中搜索私有参数。然而,不正确的实现将为攻击者提供指数级的许多选择来解决DEHP。AA\,$_β$ -密码系统是一种非对称密码方案,它利用了这个概念以及两个大素数的因式分解问题,并且仅通过使用乘法运算来实现加密和解密。利用这种简单的数学结构,它将具有低计算要求,并且将使得具有低计算能力的通信设备能够有效地部署安全通信过程。
英文摘要:
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 attacker to search for private parameters amongst the exponentially many solutions. However, an improper implementation would provide an attacker exponentially many choices to solve the DEHP. The AA\,$_β$-cryptosystem is an asymmetric cryptographic scheme that utilizes this concept together with the factorization problem of two large primes and is implemented only by using the multiplication operation for both encryption and decryption. With this simple mathematical structure, it would have low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。