A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem

TL;DR

This paper introduces a novel asymmetric cryptosystem leveraging the integer factorization problem, offering high speed and low computational requirements suitable for devices with limited processing power.

Contribution

It presents a new cryptosystem with an efficient $O(n^2)$ encryption and decryption process based on integer factorization, improving speed and simplicity over existing schemes.

Findings

Encryption and decryption operate at $O(n^2)$ speed

The scheme has a simple mathematical structure

Suitable for low-power communication devices

Abstract

A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption speed of $O(n^2)$, thus making it the fastest asymmetric encryption scheme available. It has a simple mathematical structure. Thus, it would have low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently.