Design of Partitioned $AB^2$ Systolic Modular Multiplier
Jinho Lee, Hyunsung Kim · 2006
An modular operation is an efficient basic operation for the public key cryptosystems and various systolic architectures for modular operation have been proposed. However, these architectures have a shortcoming for cryptographic applications due to their high area complexity. Accordingly, this paper presents an partitioned systolic modular multiplier over GF(). A dependency graph from the MSB modular multiplication algorithm is partitioned into 1/3 to get an partitioned systolic multiplier. The multiplier reduces the area complexity about 2/3 compared with the previous multiplier. The multiplier could be used as a basic building block to implement the modular exponentiation for the public key cryptosystems based on smartcard which has a restricted hardware requirements.