Congruência modular: critérios de divisibilidade e contribuições no ramo da segurança da informação e comunicação.

Abstract

The present work is characterized as an exploratory bibliographical research on the Theory of Numbers, especially with regard to modular congruence and its applications. Among them, we will approach some criteria of divisibility, content seen with students of the 6th grade of Elementary School II; encryption based on the Cipher of Caesar and the RSA encryption which is one of the cryptographic systems currently used in business transactions as a method considered secure; how to apply congruence in the generation of the CPF verification digits, credit card and in calculations involving calendars for obtaining the day of the week of any date from 1600. The text in which we present our research begins with some basic concepts indispensable to the development of the work and then the above mentioned applications are presented, accompanied by a brief historical context and its relation with congruences. The present research allowed us to observe that there are several studies focused on Number Theory, with special focus on modular congruence. However, it is not very common to study its applications, which are numerous.