A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q
In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape N = p2q. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's cryptosystem. Its encryption speed has a...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2013
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/39041/1/39041.pdf http://psasir.upm.edu.my/id/eprint/39041/ http://einspem.upm.edu.my/journal/fullpaper/vol7new/2.%20M.R.K.%20Arifffin%20et%20al.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|