Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1141200 | Mathematics and Computers in Simulation | 2008 | 7 Pages |
Abstract
This study presents an efficient division architecture using restricted irreducible polynomial on elliptic curve cryptosystem (ECC), based on cellular automata. The most expensive arithmetic operation in ECC is division, which is performed by multiplying the inverse of a multiplicand. The proposed architecture is highly regular, expandable, and has reduced latency and hardware complexity. The proposed architecture can be efficiently used in the hardware design of crypto-coprocessors.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Jun-Cheol Jeon, Kee-Young Yoo,