An asymmetric primitive based on the Bivariate Function Hard Problem

2013/01/29 by Ariffin, Muhammad Rezal Kamel
#11D45 #11T71 #94A60 #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1301.6963

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²) for both encryption and decryption.

Related

• Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Hard Problem
• The regular multivariate quadratic problem
• A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
• The SAT solving method as applied to cryptographic analysis of asymmetric ciphers
• The complexity of solving a random polynomial system