On Generalized Solutions of Linear Congruence ax = b (mod n) for Large Modulus n

• Egile nagusia: Polemer M. Cuarto (Egilea)
• Formatua: Liburua
• Argitaratua: Philippine Association of Institutions for Research, Inc., 2018-01-01T00:00:00Z.
• Gaiak: article
• Sarrera elektronikoa: Connect to this object online.

Number Theory, a branch of Pure Mathematics, is crucial in cryptographic algorithms. Many cryptographic systems depend heavily on some topics of Number Theory. One of these topics is the linear congruence. In cryptography, the concept of linear congruence is used to directly underpin public key cryp...