Detail publikace

Montgomery Multiplication in GF(p) and GF(2^n)

DRÁBEK, V. Montgomery Multiplication in GF(p) and GF(2^n). Brno: Brno University of Technology, 2003. p. 106-109. ISBN: 80-214-2452-4.
Typ
konferenční sborník (ne článek)
Jazyk
anglicky
Autoři
Drábek Vladimír, doc. Ing., CSc. (FIT)
Klíčová slova

Finite fields arithmetic, hardware architecture, Montgomery multiplication algorithm, Montgomery multiplier, FPGA

Abstrakt

The paper describes different modifications of Montgomery multiplication algorithm, namely multiplication in binary space, in the finite Galois field GF(2m) and possibly in the finite field of elliptic curves. Hardware implementations are also considered.

Rok
2003
Strany
106–109
ISBN
80-214-2452-4
Vydavatel
Brno University of Technology
Místo
Brno
BibTeX 
@proceedings{BUT64119,
  editor="Vladimír {Drábek}",
  title="Montgomery Multiplication in GF(p) and GF(2^n)",
  year="2003",
  pages="106--109",
  publisher="Brno University of Technology",
  address="Brno",
  isbn="80-214-2452-4"
}
Nahoru