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

dc.authorscopusid15833929800
dc.authorscopusid6603589033
dc.contributor.authorAkleylek, S.
dc.contributor.authorÖzbudak, F.
dc.date.accessioned2020-06-21T14:28:03Z
dc.date.available2020-06-21T14:28:03Z
dc.date.issued2012
dc.departmentOndokuz Mayıs Üniversitesien_US
dc.department-temp[Akleylek] Sedat, Department of Computer Engineering, Ondokuz Mayis Üniversitesi, Samsun, Turkey, Institute of Applied Mathematics, Middle East Technical University (METU), Ankara, Ankara, Turkey; [Özbudak] Ferruh, Department of Mathematics, Middle East Technical University (METU), Ankara, Ankara, Turkeyen_US
dc.description.abstractWe 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.en_US
dc.identifier.doi10.1109/TC.2011.29
dc.identifier.endpage432en_US
dc.identifier.issn0018-9340
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-84856261043
dc.identifier.scopusqualityQ2
dc.identifier.startpage427en_US
dc.identifier.urihttps://doi.org/10.1109/TC.2011.29
dc.identifier.volume61en_US
dc.identifier.wosWOS:000299344700013
dc.identifier.wosqualityQ2
dc.language.isoenen_US
dc.publisherIEEE Computer Socen_US
dc.relation.ispartofIEEE Transactions on Computersen_US
dc.relation.journalIeee Transactions on Computersen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectElliptic Curve Cryptographyen_US
dc.subjectGalois Field Arithmeticen_US
dc.subjectRedundant Representationen_US
dc.subjectVLSI Implementationen_US
dc.titleModified Redundant Representation for Designing Arithmetic Circuits with Small Complexityen_US
dc.typeArticleen_US
dspace.entity.typePublication

Files