Publication detail

Modelling of Montgomery Multiplication in GF(2^m)

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

Original Title

Modelling of Montgomery Multiplication in GF(2^m)

English Title

Modelling of Montgomery Multiplication in GF(2^m)

Type

conference paper

Language

en

Original 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.

English 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.

Keywords

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

RIV year

2001

Released

01.01.2001

Location

Ostrava

ISBN

80-85988-57-7

Book

Proceedings of the 35th Spring International Conference MOSIS'01

Pages from

441

Pages to

446

Pages count

6

Documents

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"
}