Efficient FPGA design of exception-free generic elliptic curve cryptosystems
Elliptic curve cryptography (ECC) is one of the promising cryptosystems in embedded systems as it provides high-security levels with short keys. Therefore, ECC is becoming a mainstream cryptosystem in embedded systems where memory resources are constrained. The dominant computation of ECCs is scalar multiplication, which computes \(kP\) for an elliptic curve point \(P\) and a scalar \(k\). In this paper, the main focus is on efficient hardware-software FPGA design of generic ECC with less memory which is secure against SPA and satisfies exception-free for any \(k\). Especially, the authors consider the system-on-chip (SoC) type of an FPGA device. The key points in its design are (1) secure and exception-free for any scalar with less memory usage, (2) long-bit modular arithmetic modules utilizing today's advanced and high-performance programmable logic and considering the balance between the modules in terms of propagation delay, (3) parallelism extraction inside each elliptic curve point computation as well as between the point computations, and (4) efficient hardware-software co-processing facilitated by application interfaces between a processing core and hardware modules. The evaluation results demonstrate that this design achieves the best performance to existing FPGA designs without using a table for generic ECC. For the entire collection see [Zbl 1482.94010].
- scientific article; zbMATH DE number 1504815
- Design and implementation of elliptic curve point multiplication processor over GF\((2^m)\)
- Reconfigurable architecture for elliptic curve cryptography using FPGA
- scientific article; zbMATH DE number 1941127
- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
- A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
- A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
- Complete addition formulas for prime order elliptic curves
- Elliptic Curve Cryptosystems
- Highly Regular m-Ary Powering Ladders
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1941255 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- Modular Multiplication Without Trial Division
- Parallel crypto-devices for GF(p) elliptic curve multiplication resistant against side channel attacks
- Petrel: Power and Timing Attack Resistant Elliptic Curve Scalar Multiplier Based on Programmable ${\rm GF}(p)$ Arithmetic Unit
- Secure and compact elliptic curve cryptosystems
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- On efficient implementation of FPGA-based hyperelliptic curve cryptosystems
- Ultra high-performance ASIC implementation of SM2 with SPA resistance
- ECC on your fingertips: a single instruction approach for lightweight ECC design in \(\mathrm{GF}(p)\)
- A Fast and Compact FPGA Implementation of Elliptic Curve Cryptography Using Lambda Coordinates
- An extensible and high speed FPGA embedded ECC circuit design
- scientific article; zbMATH DE number 6501605 (Why is no real title available?)
- Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
- scientific article; zbMATH DE number 1504815 (Why is no real title available?)
- Efficient elliptic curve cryptographic hardware design for wireless security
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Efficient FPGA design of exception-free generic elliptic curve cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117041)
