Efficient implementations of cryptosystems are important for resourcelimited devices, e.g. RFID tags, to compute necessary cryptographic operations. To reduce the number of cryptographic operations, a signed digit representation for a scalar is the most useful method. A signed digit representation can reduce the nonzero density of the representation. King introduced a left-to-right representation called NAF* (non-adjacent form*) which nonzero density is the same as NAF and MOF (mutual opposite form). In this paper, we will propose a modified NAF*, and demonstrate that it is more efficient than the original NAF*. The recoding time of modified NAF* achieves at least 64.5% time reduction supported by simulation results.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com