Publication:
Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity

Thumbnail Image

Date

2012

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE Computer Soc

Research Projects

Organizational Units

Journal Issue

Abstract

We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for any finite field. We also give some applications in cryptography. © 2012 IEEE.

Description

Keywords

Elliptic Curve Cryptography, Galois Field Arithmetic, Redundant Representation, VLSI Implementation

Citation

WoS Q

Q2

Scopus Q

Q2

Source

IEEE Transactions on Computers

Volume

61

Issue

3

Start Page

427

End Page

432

URI

https://doi.org/10.1109/TC.2011.29

Collections

Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu

Endorsement

Review

Supplemented By

Referenced By