Veuillez utiliser cette adresse pour citer ce document :
http://dspace1.univ-tlemcen.dz/handle/112/21686Affichage complet
| Élément Dublin Core | Valeur | Langue |
|---|---|---|
| dc.contributor.author | MEKKIOUI, Abdallah Salah Eddine | - |
| dc.contributor.author | MIR, Zakaria | - |
| dc.date.accessioned | 2024-02-04T09:51:43Z | - |
| dc.date.available | 2024-02-04T09:51:43Z | - |
| dc.date.issued | 2023-06-18 | - |
| dc.identifier.uri | http://dspace1.univ-tlemcen.dz/handle/112/21686 | - |
| dc.description.abstract | Numeric Securityisthetopicofthecentury,Toprotectthesecrecyof sensitivenumericaldataduringtransmissionandstorage,itrequirestheuse of powerfulencryptiontechniques.Strongauthenticationandaccesscontrols also aidinpreventingunauthorizedpartiesfromobtainingprivatenumeri- cal data.Numericdataintegrityandsecuritymustberegularlymonitored, audited, andcompliantwithindustrystandardstosafeguardpeopleandbusi- nesses frompotentialfinancialloss,identitytheft,andothercyberthreats. This thesisstudytheintegersfactorizationsinceManypublickeycryp- tosystems dependonthedifficultyoffactoringlargeintegers,butfirstwewill begoingthroughcryptographyfromthebeginningandtracingitdevelop- mentuntilarrivingtothemostefficientalgorithmforfactorizationwishisthe GNFS algorithm | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | University of Tlemcen | en_US |
| dc.subject | Cryptography/security/Algorithms/Factorization/publickey | en_US |
| dc.title | Performance study and evaluation of the GNFS factorization algorithm | en_US |
| dc.type | Thesis | en_US |
| Collection(s) : | Master en Télécommunication | |
Fichier(s) constituant ce document :
| Fichier | Description | Taille | Format | |
|---|---|---|---|---|
| Performance_study_and_evaluation_of_the_GNFS_factorization_algorithm.pdf | 1,09 MB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.