| VRSTA GRADIVA | analitična raven (sestavni del), tekstovno gradivo, tiskano, 1.01 - izvirni znanstveni članek |
| DRŽAVA IZIDA | Slovenija |
| LETO IZIDA | 2006 |
| JEZIK BESEDILA/IZVIRNIKA | angleški |
| PISAVA | latinica |
| AVTOR | Nedjah, Nadia - avtor |
| ODGOVORNOST | Macedo Mourelle, Luiza de - avtor |
| NASLOV | ǂA ǂreview of modular multiplication methods and respective hardware implementations |
| V PUBLIKACIJI | Informatica. - ISSN 0350-5596. - ǂVol. ǂ30, ǂno. ǂ1 (2006), str. 111-129. |
| KRATKA VSEBINA | Generally speaking, public-key cryptographic system consist of raising elements of some group such as GF(2n), Z/NZ or elliptic curves, to large powers and reducing the result modulo some given elements. Such operation is often called modular exponentiation and is performed using modular multiplications repeatedly. The practicality of a given cryptographic system depends heavily on how fast modular exponentiations are performed. Consequently, it also depends on how efficiently modular multiplications are done as thee are at base of the computation. This problem has received much attention over the years. Software as well as hardware efficient implementation were proposed. However, the results are scattered through the literature. In this paper wesurvey most known and recent methods for efficient modular multiplication, investigating and examining their strengths and weaknesses. For each methodpresented, we provide and adequate hardware implementation. |
| OPOMBE | Bibliografija: str. 128-129 |
| PREDMETNE OZNAKE | // kriptografija // komunikacijski sistemi |
| UDK | 004.4 |