Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Sahu, Hemlal
- A New Public Key Cryptosystem based on Weil Pairing
Abstract Views :191 |
PDF Views:3
Authors
B. K. Sharma
1,
Hemlal Sahu
1
Affiliations
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.) 492010, IN
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.) 492010, IN
Source
International Journal of Advanced Networking and Applications, Vol 5, No 2 (2013), Pagination: 1883-1885Abstract
In 1987 Koblitz and Miller first proposed public key cryptosystems using the group of points of an elliptic curve over a finite field. The security of these cryptosystems was based upon the presumed intractability of the problem of computing logarithm in the elliptic curve group. Now we propose a new cryptosystem over elliptic curves whose security is based on expressing a torsion point in terms of the basis points. Since latter is more complicated than solving ECDLP. Consequently our cryptosystem is more secure than all cryptosystems based on ECDLP.Keywords
Cryptography, Cryptosystem, Elliptic Curve, Weil Pairing.Full Text
- ID-Based Signature Scheme with Weil Pairing
Abstract Views :195 |
PDF Views:3
Authors
Affiliations
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.) 492010, IN
1 School of Studies in Mathematics, Pt. Ravishankar Shukla University, Raipur (C.G.) 492010, IN
Source
International Journal of Advanced Networking and Applications, Vol 5, No 2 (2013), Pagination: 1893-1897Abstract
Digital signature is an essential component in cryptography. Digital signaturesguarantee end-to-end message integrity and authentication information about the origin of a message. In this paper we propose a new identification based digital signature scheme with weil pairing. Also we analyze security and efficiency of our scheme. Security of our scheme is based on expressing the torsion point of curve into linear combination of its basis points; it is more complicated than solving ECDLP(Elliptic Curve Discrete Logarithm Problem). We claim that our new identification based digital signature scheme is more secure and efficient than the existing scheme of Islam et al(S. K. Hafizul Islam, G.P. Biswas, An Efficient and Provably-secure Digital signature Scheme based on Elliptic Curve Bilinear Pairings, Theoretical and Applied Informatics ISSN 18965334 Vol.24, no. 2, 2012, pp. 109-118) based on bilinear pairing.Keywords
Cryptography, Digital Signature Scheme, Identification Scheme, Elliptic Curve Cryptosystem, Chosen Message Attack.Full Text