Implémentation de la multiplication des grands nombres par FFT dans le contexte des algorithmes cryptographiques
dc.contributor.advisor | David, Jean Pierre | |
dc.contributor.advisor | Brassard, Gilles | |
dc.contributor.author | Kalach, Kassem | |
dc.date.accessioned | 2017-03-15T01:20:40Z | |
dc.date.available | 2017-03-15T01:20:40Z | |
dc.date.issued | 2006 | |
dc.date.submitted | 2005 | |
dc.identifier.uri | http://hdl.handle.net/1866/16695 | |
dc.subject | Cryptographie | |
dc.subject | Multiplication modulaire | |
dc.subject | Multiplication de Grands Entiers | |
dc.subject | FPGA | |
dc.subject | Transformée de Fourier Rapide (FFT) | |
dc.title | Implémentation de la multiplication des grands nombres par FFT dans le contexte des algorithmes cryptographiques | |
dc.type | Thèse ou mémoire / Thesis or Dissertation | |
etd.degree.discipline | Informatique | fr |
etd.degree.grantor | Université de Montréal | fr |
etd.degree.level | Maîtrise / Master's | |
etd.degree.name | M. Sc. | |
dcterms.description | Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal. | fr |
dcterms.language | fra |
Files in this item
This item appears in the following Collection(s)
This document disseminated on Papyrus is the exclusive property of the copyright holders and is protected by the Copyright Act (R.S.C. 1985, c. C-42). It may be used for fair dealing and non-commercial purposes, for private study or research, criticism and review as provided by law. For any other use, written authorization from the copyright holders is required.