Detail publikace

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

Originální název

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

Anglický název

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

Jazyk

en

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.

Anglický 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.

BibTex


@proceedings{BUT64119,
  author="Vladimír {Drábek}",
  title="Montgomery Multiplication in GF(p) and GF(2^n)",
  annote="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.",
  address="Brno University of Technology",
  chapter="64119",
  institution="Brno University of Technology",
  year="2003",
  month="september",
  pages="106--109",
  publisher="Brno University of Technology",
  type="conference proceedings"
}