Claim Missing Document
Check
Articles

Found 2 Documents
Search

Enhancing the Daftardar Jafari Method for Solving the Bagley–Torvik Equation through Numerical Approaches Saje, A. A; Kwami, A. M; Madaki, A. G; O, Okai J.; Waziri, I. M.; Hafsat, Yakubu
Journal of Multidisciplinary Science: MIKAILALSYS Vol 3 No 2 (2025): Journal of Multidisciplinary Science: MIKAILALSYS
Publisher : Darul Yasin Al Sys

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58578/mikailalsys.v3i2.5337

Abstract

A robust algorithm is introduced in the development of the Enhanced Daftardar Jafari Method (DJM) to effectively address both linear and nonlinear Bagley–Torvik equations (BTE) and other fractional order differential equations. The method's efficacy is demonstrated through numerical examples, showcasing its ability to solve these equations without resorting to linearization or small perturbations. The results affirm the method's strength, accuracy, and simplicity in comparison to alternative approaches.
Secure Multiparty Computation over Elliptic Curve Cryptography L., Domven; Hina, A. D.; Kwami, A. M; Miri, C. M.; I., Abdullahi
Mikailalsys Journal of Advanced Engineering International Vol 2 No 3 (2025): Mikailalsys Journal of Advanced Engineering International
Publisher : Darul Yasin Al Sys

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58578/mjaei.v2i3.6804

Abstract

This study proposes a secure mobile voting system that integrates elliptic curve cryptography (ECC) with secure multiparty computation (SMPC) to guarantee vote confidentiality, integrity, and verifiability. Designed to enable scalable, privacy-preserving elections via mobile devices, the system authenticates voters using registered numbers and records ballots as encrypted points on an elliptic curve. Encrypted votes are published on a public bulletin board alongside zero-knowledge proofs to ensure their validity. To safeguard decryption, Shamir’s secret sharing distributes keys among trusted authorities, enabling collective tallying without exposing individual votes. The system incorporates ECC-based secret sharing, homomorphic encryption, and zero-knowledge proofs, leveraging the hardness of the elliptic curve discrete logarithm problem (ECDLP) for robust security. Both experimental and theoretical evaluations demonstrate that ECC significantly improves computational efficiency and scalability, making the system well-suited for resource-constrained environments. Overall, the integration of ECC and SMPC offers a practical, efficient, and secure framework for mobile elections, effectively balancing privacy, security, and performance.