Article detail · 2003
Architectures for unified field inversion with applications in elliptic curve cryptography
- Year
- 2003
- Type
- conference-paper
Abstract
OpenAlex · English
We present two new inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inverse algorithm. A hardware architecture implementing these algorithms is also introduced. In our proposed architecture, the field elements are represented using a multi-word format which allows a scalable and unified architecture to operate in a broad range of precision. This hardware architecture can be used to obtain efficient implementations of elliptic curve cryptography primitives.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
28 citations
OpenAlex cited_by_count (cache / database)
7 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).
- Finite Field Arithmetic for Cryptography 2010
- Efficient unified Montgomery inversion with multibit shifting 2005
- Montgomery inversion 2018
- Montgomery inversion 2017
- A dual-field modular division algorithm and architecture for application specific hardware 2005
- Efficient Unified Arithmetic for Hardware Cryptography 2008
- Unified Arithmetic for Public-Key Cryptography with Hardware Implementations 2012