An asymmetric primitive based on the Bivariate Function Hard Problem
Cryptography and Security
2013-02-01 v2 Information Theory
math.IT
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.
Keywords
Cite
@article{arxiv.1301.6963,
title = {An asymmetric primitive based on the Bivariate Function Hard Problem},
author = {Muhammad Rezal Kamel Ariffin},
journal= {arXiv preprint arXiv:1301.6963},
year = {2013}
}