Modular divider for elliptic curve cryptographic hardware based on programmable CA

Authors:
Jun-Cheol Jeon;Kee-Won Kim;Jai-Boo Oh;Kee-Young Yoo
Affiliations:
Department of Computer Engineeing, Kyungpook National University, Daegu, Korea;Department of Computer Engineeing, Kyungpook National University, Daegu, Korea;Department of Computer Engineeing, Kyungpook National University, Daegu, Korea;Department of Computer Engineeing, Kyungpook National University, Daegu, Korea
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Year:
2006

Citing 7
Cited 0

Error-control coding for computer systems

Error-control coding for computer systems
Principles of digital design

Principles of digital design
New Systolic Arrays for C + AB2, Inversion, and Division in GF(2m)

IEEE Transactions on Computers
Cellular automata transforms: theory and applications in multimedia compression, encryption, and modeling

Cellular automata transforms: theory and applications in multimedia compression, encryption, and modeling
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
Network security: private communication in a public world, second edition

Network security: private communication in a public world, second edition

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study presents an efficient division architecture using irreducible trinomial in GF(2n), based on programmable cellular automata (PCA). The most expensive arithmetic operation in elliptic curve cryptosystems (ECC) is division, which is performed by multiplying the inverse of a multiplicand. The proposed architecture is highly regular, expandable, and has reduced latency. The proposed architecture can be efficiently used in the hardware design of crypto-coprocessors.