Linear Congruence ax ≡ b (mod n) Solver

Polemer M. Cuarto^1,

¹Mindoro State College of Agriculture and Technology – Calapan City Campus, Masipit, Calapan City, Oriental Mindoro, Philippines

Cite this paper:
Polemer M. Cuarto. Linear Congruence ax ≡ b (mod n) Solver. American Journal of Educational Research. 2018; 6(2):149-151. doi: 10.12691/education-6-2-10

Abstract

Although there are existing methods for solving linear congruence ax ≡ b (mod n), finding solutions still remain difficult especially when the modulus n is large. Thus, this paper aimed to develop a linear congruence solver that will provide step by step solutions even for large modulus n. The linear congruence solver was based on alternative numerical method devised by the researcher and was developed using Microsoft Visual Studio C# programming language. The system was tested using ISO 9126 standard questionnaire for software quality characteristics such as functionality, reliability, and usability. The result of the evaluation shows that the developed linear congruence solver is highly functional, highly reliable and highly usable. The use of linear congruence solver as an instructional aid for instructors and students is highly recommended.

Keywords:
mathematics number theory linear congruence ax ≡ b (mod n) developmental research method ISO 9126 software quality characteristics

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]	Krithika, K. (2014). A review on asymmetric cryptography – RSA and Elgamal algorithm. International Journal of Innovative Research in Computer and Communication Engineering, 5(2), 98-105.
[2]	Sattarova Feruza, Y., & Kim, T. H. (2007). IT security review: privacy, protection, access control, assurance and system security. International Journal of Multimedia and Ubiquitous Engineering, 2(2), 17-32.
[3]	Sheth, R. K. (2015). Analysis of cryptography techniques. International Journal of Research in Advanced Engineering, 1(2), 1-6.
[4]	Goyal, S. (2012). A survey on the applications of cryptography. International Journal of Science and Technology, 1(3), 137-140.
[5]	Arya, P. K., Aswal, M. S., & Kumar, V. (2015). Comparative study of asymmetric key cryptographic algorithms. International Journal of Computer Science & Communication Networks, 5(1), 17-21.
[6]	Gupta,D.K., Srivastava, S.K., Singh, V. (2012). New concept of symmetric encryption algorithm a hybrid approach of caesar cipher and columnar transposition in multi stages. Journal of Global Research in Computer Science, 3(1), 60-66.
[7]	Ashioba, N. C., & Yoro, R. E. (2014). RSA Cryptosystem using Object-Oriented Modeling Technique. International Journal of Information and Communication Technology Research, 4(2), 57-61.
[8]	Ore, O. (1988). Number Theory and Its History. Dover Publications, Inc., New York.
[9]	Burton, D. M. (2011). Elementary Number Theory Seventh Edition. McGraw Hill International Companies Inc.
[10]	Gold, J. F., & Tucker, D. H. (1995). A novel solution of linear congruences. In NCUR IX (Vol. 2), pp. 708-712.
[11]	Cuarto, P. (2014). Algebraic algorithm for solving linear congruences: its application to cryptography. Asia Pacific Journal of Education, Arts and Sciences, 1(1), 34-37.
[12]	Cuarto, P. (2015). Algebraic method for solving system of linear congruences. Recoletos Multidisciplinary Research Journal, 3(1), 93-100.
[13]	ISO 9126 Software Quality Characteristics. Retrieved from http://www.sqa.net/iso9126.html.