Modelling of Montgomery Multiplication in GF(2^m)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F01%3APU28636" target="_blank" >RIV/00216305:26220/01:PU28636 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Modelling of Montgomery Multiplication in GF(2^m)
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 35th Spring International Conference MOSIS'01
ISBN
80-85988-57-7
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
441-446
Publisher name
Neuveden
Place of publication
Ostrava
Event location
Hradec nad Moravicí
Event date
May 9, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—