Show simple item record  

dc.contributor.authorWill, Mark Antonyen_NZ
dc.contributor.authorKo, Ryan K.L.en_NZ
dc.contributor.editorMueller, P.en_NZ
dc.contributor.editorThampi, S.M.en_NZ
dc.contributor.editorBhuiyan, M.Z.A.en_NZ
dc.contributor.editorKo, R.en_NZ
dc.contributor.editorDoss, R.en_NZ
dc.contributor.editorCalero, J.M.A.en_NZ
dc.coverage.spatialLNM Inst Informat Technol, Jaipur, INDIAen_NZ
dc.date.accessioned2017-05-11T04:09:12Z
dc.date.available2016en_NZ
dc.date.available2017-05-11T04:09:12Z
dc.date.issued2016en_NZ
dc.identifier.citationWill, M. A., & Ko, R. K. L. (2016). Computing Mod with a Variable Lookup Table. In P. Mueller, S. M. Thampi, M. Z. A. Bhuiyan, R. Ko, R. Doss, & J. M. A. Calero (Eds.), SSCC 2016: International Symposium on Security in Computing and Communication (Vol. 625, pp. 3–17). Singapore: Springer Nature Singapore Pte Ltd. https://doi.org/10.1007/978-981-10-2738-3_1en
dc.identifier.isbn978-981-10-2737-6en_NZ
dc.identifier.issn1865-0929en_NZ
dc.identifier.urihttps://hdl.handle.net/10289/11039
dc.description.abstractEncryption algorithms are designed to be difficult to break without knowledge of the secrets or keys. To achieve this, the algorithms require the keys to be large, with some having a recommend size of 2048-bits or more. However most modern processors only support computation on 64-bits at a time. Therefore standard operations with large numbers are more complicated to implement. One operation that is particularly challenging to efficiently implement is modular reduction. In this paper we propose a highly-efficient algorithm for solving large modulo operations; it has several advantages over current approaches as it supports the use of a variable sized lookup table, has good spatial and temporal locality allowing data to be streamed, and only requires basic processor instructions. Our proposed algorithm is theoretically compared to widely used modular algorithms, and shows improvements over other algorithms using predefined lookup tables.
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherSpringer Nature Singapore Pte Ltden_NZ
dc.rights© Springer Nature Singapore Pte Ltd. 2016.This is the author's accepted version. The final publication is available at Springer via dx.doi.org/10.1007/978-981-10-2738-3_1
dc.source4th International Symposium on Security in Computing and Communications (SSCC)en_NZ
dc.subjectScience & Technologyen_NZ
dc.subjectTechnologyen_NZ
dc.subjectComputer Science, Theory & Methodsen_NZ
dc.subjectEngineering, Electrical & Electronicen_NZ
dc.subjectComputer Scienceen_NZ
dc.subjectEngineeringen_NZ
dc.titleComputing Mod with a Variable Lookup Tableen_NZ
dc.typeConference Contribution
dc.identifier.doi10.1007/978-981-10-2738-3_1en_NZ
dc.relation.isPartOfSSCC 2016: International Symposium on Security in Computing and Communicationen_NZ
pubs.begin-page3
pubs.elements-id142962
pubs.end-page17
pubs.finish-date2016-09-24en_NZ
pubs.place-of-publicationSingapore
pubs.publication-statusPublisheden_NZ
pubs.start-date2016-09-21en_NZ
pubs.volume625en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record