DC FieldValueLanguage
dc.contributor.authorBunimov, Viktor-
dc.contributor.authorSchimmler, Manfred-
dc.contributor.authorTolg, Boris-
dc.date.accessioned2020-08-26T12:17:01Z-
dc.date.available2020-08-26T12:17:01Z-
dc.date.issued2002
dc.identifier.urihttp://hdl.handle.net/20.500.12738/3344-
dc.description.abstractA new version of Montgomery’s algorithm for modular multiplication of large integers and its implementation in hardware is presented. It has been designed to meet the predominant requirements of most modern devices: small chip area and low power consumption. The algorithm is superior to the original method by a factor of 2, with respect to both area and latency. The new method has a simple structure. It requires a small amount of precomputation and storage in order to reduce the number of neccessary additions by a factor of 2.
dc.titleA Complexity-Effective Version of Montgomery's Algorihm
dc.typeinProceedingsen_US
dc.relation.conferenceWorkshop on Complexity Effective Designsen_US
tuhh.oai.showtrueen_US
tuhh.publication.instituteDepartment Medizintechniken_US
tuhh.publication.instituteFakultät Life Sciencesen_US
tuhh.type.opusInProceedings (Aufsatz / Paper einer Konferenz etc.)-
dc.type.casraiConference Paper-
dc.type.dinicontributionToPeriodical-
dc.type.drivercontributionToPeriodical-
dcterms.DCMITypeText-
item.fulltextNo Fulltext-
item.creatorGNDBunimov, Viktor-
item.creatorGNDSchimmler, Manfred-
item.creatorGNDTolg, Boris-
item.openairetypeinProceedings-
item.grantfulltextnone-
item.creatorOrcidBunimov, Viktor-
item.creatorOrcidSchimmler, Manfred-
item.creatorOrcidTolg, Boris-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_5794-
crisitem.author.deptDepartment Umwelttechnik-
crisitem.author.parentorgFakultät Life Sciences-
Appears in Collections:Publications without full text
Show simple item record

Page view(s)

36
checked on Jan 13, 2025

Google ScholarTM

Check

HAW Katalog

Check

Add Files to Item

Note about this record


Items in REPOSIT are protected by copyright, with all rights reserved, unless otherwise indicated.