Horner's Rule-Based Multiplication over Fp and Fp^n: A Survey

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00148210
Contributor : Jean-Michel Muller <>
Submitted on : Tuesday, May 22, 2007 - 9:37:33 AM
Last modification on : Wednesday, November 20, 2019 - 8:23:16 AM
Long-term archiving on : Thursday, April 8, 2010 - 5:22:10 PM

File

rr2007-19.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : ensl-00148210, version 1

Collections

Citation

Jean-Michel Muller, Jean-Luc Beuchat, Takanori Miyoshi, Eiji Okamoto. Horner's Rule-Based Multiplication over Fp and Fp^n: A Survey. International Journal of Electronics, Taylor & Francis, 2008, 95 (7), pp.669-685. ⟨ensl-00148210⟩

Share

Metrics

Record views

183

Files downloads

474