Sciweavers

Share
IJNSEC
2006

A Fast Semantically Secure Public Key Cryptosystem Based on Factoring

9 years 5 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent attack. In this paper we propose a cryptosystem over singular cubic curve using the idea of Koyama and Kouichi et al. Our proposed cryptosystem is approximately two times faster than the cryptosystem given by Kouichi et al. with the same security label and more efficient than the Koyama scheme at higher security label. Further, the partially known plaintext attack and the linearly related plaintext attacks are analyzed and concluded that those are not possible in the proposed scheme.
Sahadeo Padhye, Birendra Kumar Sharma
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where IJNSEC
Authors Sahadeo Padhye, Birendra Kumar Sharma
Comments (0)
books