Fast modular division for application in ECC on reconfigurable logic

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

Elliptic Curve Public Key Cryptosystems are becoming increasingly popular for use in mobile devices and applications where bandwidth and chip area are limited. They provide much higher levels of security per key length than established public key systems such as RSA. The underlying operation of elliptic curve point multiplication requires modular multiplication, division/inversion and addition/subtraction. Division is by far the most costly operation in terms of speed. This paper proposes a new divider architecture and implementation on FPGA for use in an ECC processor.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsPeter Y. K. Cheung, George A. Constantinides, Jose T. de Sousa
PublisherSpringer Verlag
Pages786-795
Number of pages10
ISBN (Electronic)3540408223, 9783540408222
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2778
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Fast modular division for application in ECC on reconfigurable logic'. Together they form a unique fingerprint.

Cite this