A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
This addresses secure communication for devices with low computing power, but appears incremental as it builds on existing factorization-based methods.
The paper tackles the problem of slow asymmetric encryption by proposing a new cryptosystem based on the Integer Factorization Problem, achieving O(n^2) encryption and decryption speed, which is claimed to be the fastest available.
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.