Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Error-control coding for computer systems
Error-control coding for computer systems
New Systolic Arrays for C + AB2, Inversion, and Division in GF(2m)
IEEE Transactions on Computers
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Systolic architectures for inversion/division using AB2 circuits in GF(2m)
Integration, the VLSI Journal
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Network security: private communication in a public world, second edition
Network security: private communication in a public world, second edition
Hi-index | 0.00 |
Cellular automata (CA) have been accepted as a good evolutionary computational model for the simulation of complex physical systems. They have been used for various applications, such as parallel processing computations and number theory. In the meanwhile, elliptic curve cryptosystems (ECC) are in the spotlight owing to their significantly smaller parameters. The most costly arithmetic operation in ECC is division, which is performed by multiplying the inverse of a multiplicand. Thus, this paper presents an evolutionary hardware architecture for division based on CA over GF(2n) in ECC. The proposed architecture has the advantage of high regularity, expandability, and a reduced latency based on periodic boundary CA. The proposed architecture can be used for the hardware design of crypto-coprocessors.