CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

New Short Signature Scheme with Weil Pairing

by Neetu Sharma, Birendra Kumar Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 94 - Number 10
Year of Publication: 2014
Authors: Neetu Sharma, Birendra Kumar Sharma
10.5120/16379-5883

Neetu Sharma, Birendra Kumar Sharma . New Short Signature Scheme with Weil Pairing. International Journal of Computer Applications. 94, 10 ( May 2014), 25-28. DOI=10.5120/16379-5883

@article{ 10.5120/16379-5883,
author = { Neetu Sharma, Birendra Kumar Sharma },
title = { New Short Signature Scheme with Weil Pairing },
journal = { International Journal of Computer Applications },
issue_date = { May 2014 },
volume = { 94 },
number = { 10 },
month = { May },
year = { 2014 },
issn = { 0975-8887 },
pages = { 25-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume94/number10/16379-5883/ },
doi = { 10.5120/16379-5883 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:17:26.363388+05:30
%A Neetu Sharma
%A Birendra Kumar Sharma
%T New Short Signature Scheme with Weil Pairing
%J International Journal of Computer Applications
%@ 0975-8887
%V 94
%N 10
%P 25-28
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Short signature is an essential component in cryptography. Short digital signatures are needed in environments where a human is asked to manually key in the signature. . In this paper we propose a new short 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 short signature scheme is more secure and efficient than the existing scheme of SedatAkleylek et al. based on bilinear pairing.

References
  1. FIPS 186. Digital Signature Algorithm, 1994.
  2. D. Boneh, B. Lynn and H. Shacham, 2001, "Short Signatures from the Weil Pairing", Advances in Cryptology - ASIACRYPT01, LNCS 2248, Springer-Verlag, pp. 514-532.
  3. F. Zhang, R. Safavi-Naini and W. Susilo, 2004, "An efficient signature scheme from bilinear pairings and its applications", PKC 2004, Singapore. LNCS, Springer-Verlag.
  4. P. S. L. M. Barreto and H. Y. Kim, "Fast hashing onto elliptic curves over fields of characteristic 3", Cryptology ePrint Archive, Report 2001/098, available at http://eprint. iacr. org/2001/098/.
  5. D. Boneh and M. Franklin, 2001, "Identity-based encryption from the Weil pairing", Advances in Cryptology CRYPTO01, LNCS 2139, Springer-Verlag, pp. 213-229.
  6. SedatAkleylek, Bar?s Bulent K?rlar,2011, ¨Omer Sever, and ZalihaY¨uce, Short Signature Scheme From Bilinear Pairings. Journal of telecommunication and information technology.
  7. V. S. Miller,1986 Use of elliptic curves in cryptography, Advances in Cryptology-Proceedings of Crypto85, LNCS, vol. 218, Springer.
  8. J. H. Silverman, 1986, The arithmetic of elliptic curves, volume 106 of graduate texts in mathematics, springer-verlag,Newyork 1986.
  9. J. Hoffstein, J. Pipher. , and J. H. Silverman, An introduction to mathematical cryptography, springer.
Index Terms

Computer Science
Information Sciences

Keywords

Cryptography Short signature scheme Elliptic curve cryptosystem Chosen message attack Weil Pairing.

Powered by PhDFocusTM