Publication Details

Modelling of Montgomery Multiplication in GF(2^m)

VOJKŮVKA, M.; DRÁBEK, V. Modelling of Montgomery Multiplication in GF(2^m). Proceedings of the 35th Spring International Conference MOSIS'01. Ostrava: 2001. p. 441-446. ISBN: 80-85988-57-7.

Type

conference paper

Language

English

Authors

Vojkůvka Michal, Ing., Ph.D. (AIU)
Drábek Vladimír, doc. Ing., CSc. (FIT)

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

ISBN

80-85988-57-7

Place

Ostrava

BibTeX

@inproceedings{BUT5421,
  author="Michal {Vojkůvka} and Vladimír {Drábek}",
  title="Modelling of Montgomery Multiplication in GF(2^m)",
  booktitle="Proceedings of the 35th Spring International Conference MOSIS'01",
  year="2001",
  pages="441--446",
  address="Ostrava",
  isbn="80-85988-57-7"
}