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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Design and Implementation of Block Method for Computing NAF

by Harsandeep Brar, Rajpreet Kaur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 20 - Number 1
Year of Publication: 2011
Authors: Harsandeep Brar, Rajpreet Kaur
10.5120/2395-3181

Harsandeep Brar, Rajpreet Kaur . Design and Implementation of Block Method for Computing NAF. International Journal of Computer Applications. 20, 1 ( April 2011), 37-41. DOI=10.5120/2395-3181

@article{ 10.5120/2395-3181,
author = { Harsandeep Brar, Rajpreet Kaur },
title = { Design and Implementation of Block Method for Computing NAF },
journal = { International Journal of Computer Applications },
issue_date = { April 2011 },
volume = { 20 },
number = { 1 },
month = { April },
year = { 2011 },
issn = { 0975-8887 },
pages = { 37-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume20/number1/2395-3181/ },
doi = { 10.5120/2395-3181 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:06:41.494284+05:30
%A Harsandeep Brar
%A Rajpreet Kaur
%T Design and Implementation of Block Method for Computing NAF
%J International Journal of Computer Applications
%@ 0975-8887
%V 20
%N 1
%P 37-41
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Elliptic curve based cryptosystem is an efficient public key cryptosystem, which is more suitable for limited environments. The performance of elliptic curve cryptosystem heavily depends on an operation called point multiplication. It is the multiplication of a scalar with the given point on the curve. Scalar multiplication is faster by using signed binary representation as compared to binary representation. In this paper “Block Method” for computing NAF is proposed. The Proposed method is more efficient as compared to standard method for computing NAF. The paper presents the comparative study of both standard and block methods for computing NAF. In this paper we have examined that Overall computation for Point Multiplication operation with NAF method can be made more effective by improving speed of calculating the NAF Part.

References
  1. . Koblitz, “Elliptic curve cryptosystem”, Mathematics of Computation 48 (1987)203–209.
  2. R.L. Rivest, A. Shamir, L.M. Adleman, “A Method for obtaining digital signatures and public key cryptosystem”, Communications of the ACM 21 (1978) 120–126.
  3. T. ElGamal, “Public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory 31 (4) (1985) 469–472.
  4. E. Al-Daoud, R, mahmod, Md. Rushdan, A. Kilicman (2002), “A new addition formula for Elliptic curves over GF (2n)”, IEEE Transactions on Computers, vol. 51, no. 8, August 2002, pp. 972-975.
  5. Anoop MS, “Elliptic curve Cryptography”, available at http://www.infosecwriters.com/text_resources/pdf/Elliptic_Curve_AnnopMS.pdf, 5 Jan 2007.
  6. Standard Specifications for Public Key Cryptography, IEEE Standard 1363, 2000.
  7. J. Lopez, R. Dahab (2000), “An overview of elliptic curve cryptography”, Technical report, IC-00-10, May 22. Available at http://www.dcc.unicamp.br/ic-main/public-cation - e.html.
  8. A.D. Booth, “A signed binary multiplication technique”, Journal of Applied Mathematics 4 (2) (1951) 236–240.
  9. P. Balasubramaniam, E. Karthikeyan, “Elliptic Curve scalar multiplication algorithm using complementary recoding”, available at www.sciencedirect.com.
  10. F. Morain, J. Olivos, “Speeding up the computations on an elliptic curve using addition–subtraction chains”, RAIRO Theoretical Informatics and Applications 24 (1990), pp. 531–543.
  11. Rahim Ali, “Elliptic Curve Cryptography A new way for Encryption”, IEEE 2008.
  12. Alessandro Cilardo, Luigi Coppolino, Nicola Mazzocca and Luigi Romano, “Elliptic Curve Cryptography Engineering”, Proceedings of the IEEE, Vol. 94- No. 2, February 2006.
  13. G.V.S Raju, Rehan Akbani, “Elliptic Curve Cryptosystem and its applications”, IEEE 2003, pp 1540-1543.
  14. Qizhi Qiu and Qianxing Xiong, “Research on Elliptic Curve Cryptography”, the 8th international conference on computer supported cooperative work in design proceedings”, IEEE 2003, pp 698-701.
  15. G.N.Purohit, Asmita Singh Rawat, “Efficient implementation of Arithmetic operations in ECC over Binary fields”, International Journal of Computer Applications, Vol.6-No.2, September 2010.
  16. O.Srinivasa Rao, S.Pallam Setty, “Efficient mapping methods for Elliptic Curve Cryptosystems”, International Journal of engineering Science and Technology Vol. 2(8), 2010, pp 3651-3656.
  17. Kristin Lauter, “The advantages of Elliptic Curve Cryptography for Wireless Security”, IEEE Wireless Communications, February 2004, pp 62-67.
Index Terms

Computer Science
Information Sciences

Keywords

Elliptic curve cryptography Point multiplication NAF Block method

Powered by PhDFocusTM