An asymmetric primitive based on the Bivariate Function Hard Problem
arXiv:1301.6963v2
Originality Incremental advance
AI Analysis
This work addresses cryptographic security by proposing a new asymmetric primitive, but it appears incremental as it builds on existing number-theoretic foundations.
The authors tackled the problem of defining the Bivariate Function Hard Problem (BFHP) more generally and constructing an efficient asymmetric cryptosystem, resulting in a system with O(n^2) complexity for both encryption and decryption.
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.