An asymmetric primitive based on the Bivariate Function Hard Problem

TL;DR

This paper introduces a generalized form of the Bivariate Function Hard Problem and develops an efficient asymmetric cryptosystem with quadratic complexity for encryption and decryption.

Contribution

It formalizes the BFHP in a broader context and proposes a new cryptosystem based on this problem.

Findings

Cryptosystem operates with O(n^2) complexity for both encryption and decryption.

The generalized BFHP underpins the security of the proposed cryptosystem.

The approach enhances efficiency in asymmetric cryptography based on number theory.

Abstract

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.