Publication Details

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

DRÁBEK Vladimír, ed. Montgomery Multiplication in GF(p) and GF(2^n). Brno: Brno University of Technology, 2003. ISBN 80-214-2452-4.

Type

conference proceedings

Language

english

Authors

Drábek Vladimír, doc. Ing., CSc. (DCSY FIT BUT)

Keywords

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

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.

Annotation

Published

2003

Pages

106-109

Conference

Electronic Devices and Systems, Brno, CZ

ISBN

80-214-2452-4

Publisher

Brno University of Technology

Place

Brno, CZ

BibTeX

@PROCEEDINGS{FITPUB7265,
   editor = "Vladim\'{i}r Dr\'{a}bek",
   title = "Montgomery Multiplication in GF(p) and GF(2^n)",
   pages = "106--109",
   year = 2003,
   location = "Brno, CZ",
   publisher = "Brno University of Technology",
   ISBN = "80-214-2452-4",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/7265"
}