TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Telemedicine formal verification using lightweight cryptography  : An efficient, robust, and secure Radix-16 scalar multiplication in application validate

, , * ,

* Corresponding author · click or hover a name for details

pp. 1487–1496Vol. 28Issue 5-AAugust 2025DOI: 10.47974/JDMSC-2147 Crossmark XML
Received:
06 Nov 2024
Published Online:
30 Aug 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2147
Pages:
1487–1496

Abstract

The Elliptic curve cryptography (ECC) in cryptography is an interesting to go into the depth of the best performance optimization and fascinating area to work, where scalar multiplication is playing an important role and giving the insight in gaining the computation efficiency. A good efficient technical way is possible through the reduced number of precomputed operations use on scalar multiplication. The research gap shows here a systematic approach for one of the more efficient techniques is possible too by comparing to the most recent in variations of scalar multiplication schemes. We have proposed and applied Radix-16 Scalar Multiplication scheme which works without precomputation. The hardware and the software performances are representing a marginal enhancement in all the related proposed techniques on theoretical speedup on each key size=6.25% and on software perspective speedup on each key size=8.33%. The logic behind to take problem is to work on a smaller key to the best suits for the low memory devices, to initiate the operation on shorter clock cycles, and high speed to achieve with integrating to the marginal high level of security strengths. A Telemedicine application-oriented work is presented in this manuscript using the ECC, as a part of the lightweight cryptography approach, and a robust application scenario on reduced computational complexity. The approach is efficient, robust, and secure enough mathematically to justify the claimed work. Further, the formal verification tool AVISPA/SPAN is used to validate the considered work. 

Keywords

Subject Classifications

Primary 94A60Secondary 94A62

References

[1] V. Jirasek, “Practical Application of Information Security Models,” Information Security Technical Report, vol. 17, no. 1–2, pp. 1-8 (Feb. 2012). 
[2] F. Mair and P. Whitten, “Systematic review of studies of patient satisfaction with telemedicine,” British Medical Journal, vol. 320, pp. 1517–1520 (2000).
[3] W. Diffie and M.E. Hellman, “New Directions in Cryptography,” IEEE Transaction on Information Theory, vol. 22, No. 6, pp. 644-654 (Nov. 1976). 
[4] J. W. Bos, M. E. Kaihara, T. Kleinjung, A. K. Lenstra, and P. L. Montgomery, “On the security of 1024-bit RSA and 160-bit elliptic curve cryptography,” IACR Cryptology ePrint Archive, vol. 2009, p. 389. [Online]. Available: https://www.iacr.org/cryptodb/archive/2009/389/edcl21.dvi
[5] K. Jarvinen and J. Skytta, “Parallelization of High-Speed processor for Elliptic Curve Cryptography,” IEEE Transactions on VLSI, vol. 16, No. 9, pp. 1162-1175 (Sep. 2008). 
[6] Matthew A. Hein, Telemedicine: An Important Force in the Transformation of Healthcare (June 2009) [http://www.trade.gov/td/health/telemedicine_2009.pdf]
[7] Benjamin Abaidoo and Benjamin Teye Larweh, “Consumer Health Informatics: The Application of ICT in Improving Patient-Provider Partnership for a Better Health Care, Online Journal of Public Information, 6 (2) (2014).  
[8] N. Koblitz, “Elliptic Curve Cryptosystems,” Math Computation, vol. 48, No. 177, pp. 203-209 (1987).
[9] Catherine H. Gebotys, “Elliptic Curve Cryptography, Security in Embedded Devices,” Springer, pp. 75-109 (2010). DOI: 10.1007/978-1-4419-1530-6     
[10] V.S. Miller, “Use of Elliptic Curves in Cryptography,” Advances in Cryptology, pp. 417-426 (1986). DOI: 10.1007/3-540-39799-X_31
[11] D.R. Hankerson, A Menezes and S. Vanstone, “Guide to Elliptic Curve Cryptography,” Springer (2004). DOI: 10.1007/b97644
[12] P. Longa and A. Miri, “Fast and Flexible Elliptic Curve Point Arithmetic over Prime fields,” IEEE Transaction on Computers, vol. 57, No. 3, pp. 289–302 (2008).
[13] E.A.H. Abdulrahman and A. R-Masoleh, “New Regular Radix-8 Scheme for Elliptic Curve Scalar Multiplication without Pre-Computation,” IEEE Transaction on Computers, vol. 64, No. 2, pp. 438-451 (Feb. 2015). DOI: 10.1109/TC.2013.213
[14] B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs, 2nd Edition, Oxford University Press (2010).
[15] AVISPA-Automated Validation of Internet Security Protocols [online] Available: http://www.avispa-project.org
[16] D. Basin, S. Modersheim, and L. Vigano, “OFMC: A Symbolic Model-Checker for Security Protocols,” International Journal of Information Security, vol. 4, pp. 181-208 (2005). DOI: 10.1007/s10207-004-0055-7.
[17] M. Turuani, “The CL-Atse Protocol Analyzer,” Lecture Notes in Computer Science, vol. 4098, F. Pfenning, Eds. in RTE, pp. 277-286 (2006). 

Views: 265Downloads: 119Citations: 0