Montgomery Multiplication on FPGA

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03099023" target="_blank" >RIV/68407700:21230/04:03099023 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Montgomery Multiplication on FPGA

Original language description

The modular multiplication is the core operation and also the most time consuming operation in many cryptographic applications such as RSA and elliptic curve cryptography. We present a pipelined FPGA implementation of the Montgomery algorithm for modularmultiplication in GF(p) on a Field Programmable Gate Array (FPGA).

Czech name

Není k dispozici

Czech description

Není k dispozici

Type

A - Audiovisual production

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2004

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

ISBN

—

Place of publication

Praha

Publisher/client name

—

Version

—

Carrier ID

neuvedeno