Publication Details

Modelling of Montgomery Multiplication in GF(2^m)

VOJKŮVKA Michal and DRÁBEK Vladimír. Modelling of Montgomery Multiplication in GF(2^m). In: Proceedings of the 35th Spring International Conference MOSIS'01. Ostrava, 2001, pp. 441-446. ISBN 80-85988-57-7.
Type
conference paper
Language
english
Authors
Vojkůvka Michal, Ing. (DCSE FEECS BUT)
Drábek Vladimír, doc. Ing., CSc. (DCSE FEECS BUT)
Keywords

Montgomery multiplication, arithmetic in GF(2m), public-key cryptography.

Abstract

This contribution deals with arithmetic architecture for modular multiplication in GF(2m). Montgomery multiplication methods constitute the core of modular exponentiation which is at the heart of modern public-key cryptosystems. The effective use of simulation offers several advantages for development of digital circuits.

Published
2001
Pages
441-446
Proceedings
Proceedings of the 35th Spring International Conference MOSIS'01
Conference
35th Spring International Conference Modelling and Simulation of Systems (MOSIS 2001), Hradec nad Moravicí, CZ
ISBN
80-85988-57-7
Place
Ostrava, CZ
BibTeX 
@INPROCEEDINGS{FITPUB6555,
   author = "Michal Vojk\r{u}vka and Vladim\'{i}r Dr\'{a}bek",
   title = "Modelling of Montgomery Multiplication in GF(2^m)",
   pages = "441--446",
   booktitle = "Proceedings of the 35th Spring International Conference MOSIS'01",
   year = 2001,
   location = "Ostrava, CZ",
   ISBN = "80-85988-57-7",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/6555"
}
Back to top