Publication detail

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

DRÁBEK, V.

Original Title

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

Type

conference proceedings

Language

English

Original Abstract

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.

Keywords

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

Authors

DRÁBEK, V.

Released

9. 9. 2003

Publisher

Brno University of Technology

Location

Brno

ISBN

80-214-2452-4

Pages from

106

Pages to

109

Pages count

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