A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
Cryptography and Security
2012-10-24 v2 Number Theory
Abstract
A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption speed of , 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.
Cite
@article{arxiv.1209.3458,
title = {A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem},
author = {M. R. K. Ariffin},
journal= {arXiv preprint arXiv:1209.3458},
year = {2012}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1207.1157