1. Dspace@NITW
  2. Conference Papers
  3. Electronics and Communication Engineering
Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2180
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKodali, Ravi Kishore-
dc.date.accessioned2024-12-27T11:12:58Z-
dc.date.available2024-12-27T11:12:58Z-
dc.date.issued2014-
dc.identifier.citation10.1007/978-3-662-44966-0_18en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2180-
dc.descriptionNITWen_US
dc.description.abstractThis work presents a mixed-coordinate system based elliptic curve point multiplication algorithm. It employs the width-w Non-Adjacent Form (NAF) algorithm for point multiplication and uses the Montgomery trick to pre-compute the odd points P i  = iP for i = 1, 3, ⋯ , 2w − 1 with only one field inversion.en_US
dc.language.isoenen_US
dc.publisherCommunications in Computer and Information Scienceen_US
dc.subjectNon-Adjacent Form,en_US
dc.subjectPoint Multiplication,en_US
dc.subjectElliptic Curve.en_US
dc.titleA Mathematical Analysis of Elliptic Curve Point Multiplicationen_US
dc.typeArticleen_US
Appears in Collections:Electronics and Communication Engineering

Files in This Item:
File Description SizeFormat 
A mathematical analysis of elliptic curve point multiplication.pdf86.81 kBAdobe PDFView/Open
Show simple item record


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