Cellular Automata Architecture for Elliptic Curve Cryptographic Hardware

摘要

Elliptic Curve Cryptosystems (ECC) are in the spotlight due to their significantly smaller parameters. The most costly arithmetic operation in ECC is division, which is performed by multiplying the inverse of a multiplicand. On the other hand, Cellular Automata (CA) have attracted a lot of attention regarding their potential for various applications. Thus, this paper presents an EC-based hardware architectural model for division based on CA over Galois Field GF(2~n). The proposed architectural model is highly regular, expandable, and it has reduced latency based on periodic boundary CA. The proposed architecture can be easily implemented into the hardware design of crypto-coprocessors.