Scalable and Unified Hardware to Compute

نویسندگان

  • Alexandre F. Tenca
  • Çetin K. Koç
چکیده

Computing the inverse of a number in finite fields GF(p) or GF(2) is equally important for cryptographic applications. This paper proposes a novel scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2) fields. We adjust and modify a GF(2) Montgomery inverse algorithm to accommodate multi-bit shifting hardware, making it very similar to a previously proposed GF(p) algorithm. The architecture is intended to be scalable, which allows the hardware to compute the inverse of long precision numbers in a repetitive way. After implementing this unified design it was compared with other designs. The unified hardware was found to be eight times smaller than another reconfigurable design, with comparable performance. Even though the unified design consumes slightly more area and it is slightly slower than the scalable inverter implementations for GF(p) only, it is a practical solution whenever arithmetic in the two finite fields is needed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)

Computing the inverse of a number in finite fields GF(p) or GF(2) is equally important for cryptographic applications. This paper proposes a novel scalable and unified architecture for a Montgomery inverse hardware that operates in both GF(p) and GF(2) fields. We adjust and modify a GF(2) Montgomery inverse algorithm to accommodate multi-bit shifting hardware, making it very similar to a previo...

متن کامل

Efficient scalable VLSI architecture for Montgomery inversion in GF( p)

The multiplicative inversion operation is a fundamental computation in several cryptographic applications. In this work, we propose a scalable VLSI hardware to compute the Montgomery modular inverse in GF(p). We suggest a new correction phase for a previously proposed almost Montgomery inverse algorithm to calculate the inversion in hardware. We also propose an efficient hardware algorithm to c...

متن کامل

Towards Performance-Portable, Scalable, and Convenient Linear Algebra

The rise of multiand many-core architectures also gave birth to a plethora of new parallel programming models. Among these, the open industry standard OpenCL addresses this heterogeneity of programming environments by providing a unified programming framework. The price to pay, however, is that OpenCL requires additional low-level boilerplate code, when compared to vendor-specific solutions, ev...

متن کامل

Architectures for Unified Field Inversion with Applications in Elliptic Curve Cryptography

We present two new inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inverse algorithm. An 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 o...

متن کامل

New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n)

approved: The computation of th GF(p) or GF(2), is one o applications. In this work, w the design of efficient hard inverse. We suggest a new c inverse algorithm to calcula a fast hardware algorithm proposed designs have the h on constrained areas and sti calculations, the module w module operates, can be se upper limit on the operand operands and internal resul infinite-precision Montgome We a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002