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)

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

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.

Klíčová slova

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

Autoři

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

Rok RIV

2001

Vydáno

1. 1. 2001

Místo

Ostrava

ISBN

80-85988-57-7

Kniha

Proceedings of the 35th Spring International Conference MOSIS'01

Strany od

441

Strany do

446

Strany počet

6

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