Improved Bitslice implementation: parallel software implementation of elliptic curve cryptosystem

摘要

A Bitslice implementation method is suitable for parallel software implementation of elliptic curve cryptosystems. The number of paralleled operations is the word size of the CPU unit (e.g, 32, 64, etc.). But, there is a restriction in the former bitslice implementation, and this paper solves it. First, we propose "conditional move operations" for bitslice implementation. Then, we propose a general bitslice scalar multiplication of an elliptic curve over F{sub}(2{sup}m). Finally, we show that the efficiency is twice faster than the non-bitslice implementation method.