Congruences and application on cryptography
| dc.contributor.author | BOUKHALET, Fouina | |
| dc.date.accessioned | 2019-07-21T11:26:26Z | |
| dc.date.available | 2019-07-21T11:26:26Z | |
| dc.date.issued | 2019 | |
| dc.description.abstract | In this memo, we study the congruences and application in cryptography. First, we study the concept and some properties of congruences without forgetting mention some special theorems: Wilson, Fermat and Euler. Also, we study some encryption methods in cryptography and the role of congruence in this type of encryption. We provided in the clasical gryptography the substitution ciphers (Shift Cipher, affine Cipher and Vigenère Cipher), and in the asymmetric encryption (RSA Cryptosystem, Diffie-Hellmun Key Exchange, The ElGamal Cryptosystem). Such that, the RSA method based on the difficulty of factorization the prime number, and the Elgamal method based on the difficulty of solving the problem of Diffie-Hellman | en_US |
| dc.identifier.uri | https://repository.univ-msila.dz/handle/123456789/15515 | |
| dc.language.iso | en | en_US |
| dc.publisher | UNIVERSITY’S MOHAMED BOUDIAF OF M’SILA Faculty of Mathematics and computer sciences Department of Mathematics- Option :Algebre and Discrete Mathematics | en_US |
| dc.subject | Congruences , application , cryptography | en_US |
| dc.title | Congruences and application on cryptography | en_US |
| dc.type | Thesis | en_US |