Call for Paper - January 2022 Edition
IJCA solicits original research papers for the January 2022 Edition. Last date of manuscript submission is December 20, 2021. Read More

Light Weight Asymmetric Cryptographic Algorithm for Financial Transactions through Mobile Application

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
Authors:
Rina Maria, V. Anitha
10.5120/ijca2017914763

Rina Maria and V Anitha. Light Weight Asymmetric Cryptographic Algorithm for Financial Transactions through Mobile Application. International Journal of Computer Applications 170(3):37-41, July 2017. BibTeX

@article{10.5120/ijca2017914763,
	author = {Rina Maria and V. Anitha},
	title = {Light Weight Asymmetric Cryptographic Algorithm for Financial Transactions through Mobile Application},
	journal = {International Journal of Computer Applications},
	issue_date = {July 2017},
	volume = {170},
	number = {3},
	month = {Jul},
	year = {2017},
	issn = {0975-8887},
	pages = {37-41},
	numpages = {5},
	url = {http://www.ijcaonline.org/archives/volume170/number3/28054-2017914763},
	doi = {10.5120/ijca2017914763},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Nowadays world is seen through mobile internet in a fraction of seconds, which invaded the need for many mobile applications. Financial transactions through mobile phones has become primitive mode of transactions. All these mobile applications including financial transactions demands for better security due to pervasive environment. In our work, we propose light weight Elliptical Curve Cryptographic method suitable for mobile applications. Elliptic curve point multiplication or scalar multiplication is the operation of adding a point P on the elliptic curve to itself successively scalar number of times. This paper describes an algorithm for light weight computation of scalar multiplication for elliptic curves defined over binary fields using projective coordinate system eliminating the need to perform inversions as needed with computations involving affine coordinates. It effectively incorporates fast computation method for binary elliptic curves by making use of Exclusive-OR gates. The effectiveness of the algorithm is measured both by Matlab simulation and Field-Programmable Gate Array (FPGA) implementation. Hardware implementation using Verilog proves that the proposed algorithm consumes less resources in terms of delay and power.

References

  1. N. Koblitz, “Elliptic curve cryptosystems”, Mathematics of computation, 1987.
  2. J López, R Dahab, “Fast multiplication on elliptic curves over GF (2m) without precomputation”, Cryptographic Hardware and Embedded Systems, 1999.
  3. K Rabah, “Elliptic curve cryptography over binary finite field GF (2m)”, Information Technology Journal, 2006.
  4. GM de Dormale, JJ Quisquater, “High-speed hardware implementations of elliptic curve cryptography: A survey”, Journal of systems architecture, 2007.
  5. J López, R Dahab, “Improved algorithms for elliptic curve arithmetic in GF (2n)”, International Workshop on Selected Areas in Cryptography, 1998.
  6. Hankerson D., López Hernandez J., Menezes A., “Software Implementation of Elliptic Curve Cryptography over Binary Fields”, International Workshop on Cryptographic Hardware and Embedded Systems, 2000.
  7. K Okeya, K Sakura, “Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve”, Cryptographic Hardware and Embedded Systems, 2001.
  8. A Kanhe, SK Das, AK Singh, “Design and implementation of low power multiplier using vedic multiplication technique”, International Journal of Computer Science and Communication, January-June 2012.
  9. GG Kumar, V Charishma, “Design of high speed vedic multiplier using vedic mathematics techniques”, International Journal of Scientific and Research Publications, March 2012.
  10. M Poornima, SK Patil, SKP Shivukumar, Shridhar K P, Sanjay H, “Implementation of multiplier using vedic algorithm”, International Journal of Innovative Technology and Exploring Engineering, May 2013.
  11. Siba Pradhan, Ritsinghda Das, ”VLSI Implementation of Vedic Multiplier Using Urdhva-Tiryakbhaym Sutra in VHDL Environment:A Novelty”, IOSR Journal of VLSI and Signal Processing(IOSR-JVSP) Volume 5, Issue 1,ver.III(Jan-Feb-2015).
  12. Vishikha Sharma, Aniket Kumar, “Design, Implementation & Performance of Vedic Multiplier for Different Bit Lengths”, International Journal of Innovative Research in Computer and Communication Engineering, Vol. 5, Issue 4, April 2017.
  13. Kedar N. Palata,Vinobha K. Nadar,Jatin S. Jethawa,Tushar J. Surwadkar,Rajan S. Deshmukh, “Implementation of an Efficient Multiplier based on Vedic Mathematics”, International Research Journal of Engineering and Technology (IRJET),Volume: 04, Issue: 04, Apr -2017.
  14. P Gulati, H Yadav, MK Taleja, “Implementation of an efficient multiplier using the Vedic multiplication algorithm”,International Conference on Computing, Communication and Automation (ICCCA2016), April 2016.
  15. Prof. Mrs. Y.D. Kapse, Miss. Pooja R. Sarangpure, Miss. Komal M. Lokhande, “Review on a Compressor Design and Implementation of Multiplier using Vedic Mathematics”, International Journal of Advanced Research in Computer and Communication Engineering, Vol. 6, Issue 2, February 2017.

Keywords

Vedic multiplier, Urdhva Tirgyagbyham sutra, ECC, conventional array multiplier, FPGA implementation, delay, low power, low area consumption.