| Identifiant de l'article : |
 |
ensl-00148210, version 1 |
|
|
| Domaine : |
|
Informatique/Autre
|
|
|
| Titre : |
|
Horner's Rule-Based Multiplication over Fp and Fp^n: A Survey |
|
|
| Auteur(s) : |
|
Jean-Michel Muller1, Jean-Luc Beuchat2, Takanori Miyoshi2, Eiji Okamoto2 |
|
|
| Laboratoire : |
|
| 1 : |
LIP - Laboratoire de l'Informatique du Parallélisme |
|
| 2 : |
Laboratory of Cryptography and Information Security |
|
|
|
| Équipe de recherche : |
|
[ARENAIRE - Arithmétique des ordinateurs] |
| Résumé : |
|
This paper aims at surveying multipliers based on Horner's rule for finite field arithmetic. We present a generic architecture based on five processing elements and introduce a classification of several algorithms based on our model. We provide the readers with a detailed description of each scheme which should allow them to write a VHDL description or a VHDL code generator. |
|
|
|
Langue du texte
intégral : |
|
Anglais |
|
|
| Mots-clés : |
|
Modular multiplication – Horner's rule – carry-save – high-radix carry-save – borrow-save – finite field – FPGA |
|
|
| Classification : |
|
ACM B.2.0, E.3 |
|
|
Récupérer au format
