Detail publikace

Modelling of Montgomery Multiplication in GF(2^m)

VOJKŮVKA, M., DRÁBEK, V.

Originální název

Modelling of Montgomery Multiplication in GF(2^m)

Anglický název

Modelling of Montgomery Multiplication in GF(2^m)

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

Dokumenty

BibTex 


@inproceedings{BUT5421,
  author="Michal {Vojkůvka} and Vladimír {Drábek}",
  title="Modelling of Montgomery Multiplication in GF(2^m)",
  annote="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.",
  booktitle="Proceedings of the 35th Spring International Conference MOSIS'01",
  chapter="5421",
  year="2001",
  month="january",
  pages="441--446",
  type="conference paper"
}