基于二元函数困难问题的非对称基元
An asymmetric primitive based on the Bivariate Function Hard Problem
摘要:
二元函数困难问题(BFHP)在几乎所有的数论密码体制中都隐式存在。这项工作定义了BFHP在一个更一般的设置,并产生一个有效的非对称密码系统。该算法的复杂度为O(n^2)。
英文摘要:
The Bivariate Function Hard Problem (BFHP) has been in existence implicitly in almost all number theoretic based cryptosystems. This work defines the BFHP in a more general setting and produces an efficient asymmetric cryptosystem. The cryptosystem has a complexity order of O(n^2) for both encryption and decryption.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。