摘要
提出一种基于MOF(Mutual Opposite Form)的interleaving多标量乘算法,该算法在计算速度上明显快于基本inter-leaving方法,在计算速度和预存储方面和基于ωNAF(non-adjacent form)的interleaving方法相当,但MOF编码可从左到右实现,故编码和主计算可以合并,从而节省标量编码的存储空间,因此更适合于内存受限的设备上使用。
Presents a new interleaving multiple scalar multiplication algorithm based on Mutual Opposite Form, which is much faster than basic interleaving method in computing performance. This algorithm is the same as ωNAF method in computing performance and precomputation tables,but a left - to - right MOF recording scheme can be available. So the recording and evaluation stage can be merged. This saves the storage of the recoded scalar and is therefore preferable on memory - constraint devices.
出处
《微机发展》
2005年第10期90-92,102,共4页
Microcomputer Development
基金
安徽省教育厅自然科学研究项目(2002kj198)
