Elliptic curve based hardware architecture using cellular automata

Jun-Cheol Jeon and Kee-Young Yoo

Mathematics and Computers in Simulation (MATCOM), 2008, vol. 79, issue 4, 1197-1203

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.

Keywords: Elliptic curve cryptosystem; Cellular automata; Modular division; Irreducible polynomial (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037847540700256X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:79:y:2008:i:4:p:1197-1203

DOI: 10.1016/j.matcom.2007.09.006

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().