Detail publikace

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

DRÁBEK, V.

Originální název

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

Typ

konferenční sborník (ne článek)

Jazyk

angličtina

Originální 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.

Klíčová slova

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

Autoři

DRÁBEK, V.

Vydáno

9. 9. 2003

Nakladatel

Brno University of Technology

Místo

Brno

ISBN

80-214-2452-4

Strany od

106

Strany do

109

Strany počet

4

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"
}