Indian Journal of Science and Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


This research modifies the GNAF (Generalized NAF), which is one of the signed-digit representations that have been used to speed up point multiplication in pairing-based cryptosystems. The hamming weight of MGNAF (Modified Generalized Non-Adjacent Form), which is proposed in this paper, is less than GNAF for radixes higher than 2 (in cost of a bigger digit set). Moreover, in radix 2 the hamming weight of MGNAF is as low as GNAF and the well-known NAF (Non-Adjacent Form) with the same digit set.

Keywords

Cryptography, Digit Set, Generalized NAF, Hamming Weight, Non-Adjacent Form, Radix-r Representation
User