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 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.
منابع مشابه
Scalable and Unified Hardware to Compute
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...
متن کامل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...
متن کامل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...
متن کاملEfficient Scalable Hardware Architecture for Montgomery Inverse Computation in Gf(p)
The Montgomery inversion is a fundamental computation in several cryptographic applications. In this work, we propose a scalable hardware architecture 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. The intended architecture is scalable, which means that a ...
متن کاملScalable VLSI Design for Fast GF(p) Montgomery Inverse Computation
This paper accelerates a scalable GF(p) Montgomery inversion hardware. The hardware is made of two parts a memory and a computing unit. We modified the original memory unit to include parallel shifting of all bits which was a task handled by the computing unit. The new hardware modeling, simulating, and synthesizing is performed through VHDL for several 160-bits designs showing interesting spee...
متن کامل