Error-control coding for computer systems
Error-control coding for computer systems
Structure of parallel multipliers for a class of fields GF(2m)
Information and Computation
Principles of digital design
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
Two systolic architectures for modular multiplication
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)
IEEE Transactions on Computers
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Cellular automata based role-delegation in RBAC
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Authentication based on singular cellular automata
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
| Hi-index | 0.00 |
This study presents an efficient exponent architecture for public-key cryptosystems using Montgomery multiplication based on programmable cellular automata (PCA). Multiplication is the key operation in implementing circuits for cryptosystem, as the process of encrypting and decrypting a message requires modular exponentiation which can be decomposed into multiplications. Efficient multiplication algorithm and simple architecture are the key for implementing exponentiation. Thus we employ Montgomery multiplication algorithm and construct simple architecture based on irreducible all one polynomial (AOP) in GF(2^m). The proposed architecture has the advantage of high regularity and a reduced hardware complexity based on combining the characteristics of the irreducible AOP and PCA. The proposed architecture can be efficiently used for public-key cryptosystem.