Conference proceedings

 
Drábek, V. (editors): Montgomery Multiplication in GF(p) and GF(2^n), Brno, CZ, VUT v Brně, 2003, p. 106-109, ISBN 80-214-2452-4
Publication language:english
Original title:Montgomery Multiplication in GF(p) and GF(2^n)
Pages:106-109
Conference:Electronic Devices and Systems
Place:Brno, CZ
Year:2003
ISBN:80-214-2452-4
Publisher:Brno University of Technology
Keywords
Finite fields arithmetic, hardware architecture, Montgomery multiplication algorithm, Montgomery multiplier, FPGA
Annotation
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.
Abstract
BibTeX:
@PROCEEDINGS{
   editor = {Vladimír Drá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 = {http://www.fit.vutbr.cz/research/view_pub.php?id=7265}
}