Area-speed efficient modular architecture for GF(2&lt;sup&gt;m&lt;/sup&gt;) multipliers dedicated for cryptographic applications

Pamula, Danuta; Hrynkiewicz, Edward

doi:10.1109/ddecs.2013.6549784

Cited by 1 publication

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Beuchat [24] concluded that the MSE first approach requires less hardware and offers higher throughput than LSE. In [28], the reduction steps are performed separately. It is stated that for a finite field generated by irreducible polynomials FðxÞ (NIST [29]), reduction can be performed by a set of xor operations [30,31].…”

Section: Elliptic Curves and Its Use In Cryptographymentioning

confidence: 99%

“…It is stated that for a finite field generated by irreducible polynomials FðxÞ (NIST [29]), reduction can be performed by a set of xor operations [30,31]. [28] is considered only the multiplication step, implemented in a digitserial approach. A digit D = 16 is proposed since in most cases, 16-bit words give better results.…”

Section: Elliptic Curves and Its Use In Cryptographymentioning

confidence: 99%

See 1 more Smart Citation

A Compact FPGA‐Based Accelerator for Curve‐Based Cryptography in Wireless Sensor Networks

et al. 2021

View full text Add to dashboard Cite

The main topic of this paper is low-cost public key cryptography in wireless sensor nodes. Security in embedded systems, for example, in sensor nodes based on field programmable gate array (FPGA), demands low cost but still efficient solutions. Sensor nodes are key elements in the Internet of Things paradigm, and their security is a crucial requirement for critical applications in sectors such as military, health, and industry. To address these security requirements under the restrictions imposed by the available computing resources of sensor nodes, this paper presents a low-area FPGA-prototyped hardware accelerator for scalar multiplication, the most costly operation in elliptic curve cryptography (ECC). This cryptoengine is provided as an enabler of robust cryptography for security services in the IoT, such as confidentiality and authentication. The compact property in the proposed hardware design is achieved by implementing a novel digit-by-digit computing approach applied at the finite field and curve level algorithms, in addition to hardware reusing, the use of embedded memory blocks in modern FPGAs, and a simpler control logic. Our hardware design targets elliptic curves defined over binary fields generated by trinomials, uses fewer area resources than other FPGA approaches, and is faster than software counterparts. Our ECC hardware accelerator was validated under a hardware/software codesign of the Diffie-Hellman key exchange protocol (ECDH) deployed in the IoT MicroZed FPGA board. For a scalar multiplication in the sect233 curve, our design requires 1170 FPGA slices and completes the computation in 128820 clock cycles (at 135.31 MHz), with an efficiency of 0.209 kbps/slice. In the codesign, the ECDH protocol is executed in 4.1 ms, 17 times faster than a MIRACL software implementation running on the embedded processor Cortex A9 in the MicroZed. The FPGA-based accelerator for binary ECC presented in this work is the one with the least amount of hardware resources compared to other FPGA designs in the literature.

show abstract

Section: Elliptic Curves and Its Use In Cryptographymentioning

confidence: 99%

Section: Elliptic Curves and Its Use In Cryptographymentioning

confidence: 99%