Hardware Elliptic Curve Cryptographic Processor Over$rm GF(p)$

@article{McIvor2006HardwareEC,
  title={Hardware Elliptic Curve Cryptographic Processor Over\$rm GF(p)\$},
  author={Ciaran McIvor and M{\'a}ire O'Neill and John V. McCanny},
  journal={IEEE Transactions on Circuits and Systems I: Regular Papers},
  year={2006},
  volume={53},
  pages={1946-1957}
}
  • C. McIvor, M. O'Neill, J. McCanny
  • Published 18 September 2006
  • Computer Science, Mathematics
  • IEEE Transactions on Circuits and Systems I: Regular Papers
A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles… 

Figures and Tables from this paper

Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p)
TLDR
A novel hardware cryptographic processor for ECC over general prime field GF(p) is presented, optimized on circuit level by introducing new parallel modular multiplication algorithm with its efficient hardware architecture, which offers significant improvement over the previously used techniques.
Reconfigurable Hardware Implementation of Arithmetic Modulo Minimal Redundancy Cyclotomic Primes for ECC
TLDR
This work considers a reconfigurable hardware implementation of arithmetic modulo a $258-bit example, for use at the $128-bit AES security level, and examines this implementation for speed and area using parallelisation methods and inbuilt FPGA resources.
High-Performance FPGA Implementation of Modular Inversion over F_256 for Elliptic Curve Cryptography
  • Md. Selim Hossain, Yinan Kong
  • Mathematics, Computer Science
    2015 IEEE International Conference on Data Science and Data Intensive Systems
  • 2015
TLDR
The main goal is to implement a fast, high-performance modular inversion for ECC using field-programmable gate-array (FPGA) technology and an area-efficient design which takes a small amount of resources on the FPGA and needs only 1480 slices.
High-performance elliptic curve cryptography processor over NIST prime fields
TLDR
The ECP proposed in this study over F p performs better than available hardware in terms of area and timing, and the area–delay product of this design is very low compared with similar designs.
A High-Performance Elliptic Curve Cryptographic Processor of SM2 over GF(p)
TLDR
A two-stage fast reduction algorithm (TSFR) over SCA-256 prime field is proposed, which can obtain an intermediate result of 0 ≤ Z < 2 p instead of 0 ≥ Z < 14 p in traditional algorithm, avoiding a lot of repetitive subtraction operations.
Optimized FPGA Implementation of Elliptic Curve Cryptosystem over Prime Fields
  • Guoqiang Yang, Fanyu Kong, Qiuliang Xu
  • Computer Science, Mathematics
    2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)
  • 2020
TLDR
This paper designs a novel modular multiplier supporting four-level pipelining, which only needs 7 clock cycles to complete a single modular multiplication, and designs, on the basis of 4MMPO, a parallel architecture to efficiently implement point doubling and point addition operation.
FPGA based efficient Elliptic curve cryptosystem processor for NIST 256 prime field
TLDR
A very efficient Elliptic curve cryptosystem processor for NIST 256 prime field that includes separate modules to perform point addition and point doubling that is necessary to perform scalar multiplication which is the fundamental operation cryptography.
An Efficient Hardware Implementation of Finite Field Inversion for Elliptic Curve Cryptography
  • Thirumalesu Kudithi
  • Computer Science, Mathematics
    International Journal of Innovative Technology and Exploring Engineering
  • 2019
TLDR
This work presents a FSM based design methodology to achieve speed, area and high-performance modular binary inversion algorithm over 256-bit prime field, suitable for speed-critical cryptoapplications.
Petrel: Power and Timing Attack Resistant Elliptic Curve Scalar Multiplier Based on Programmable ${\rm GF}(p)$ Arithmetic Unit
TLDR
A programmable GF(p) arithmetic unit for elliptic curve cryptography that can perform modular addition, subtraction, multiplication, inversion, and division and is resistant against timing and power attacks is proposed.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
A Scalable Dual-Field Elliptic Curve Cryptographic Processor
We propose an elliptic curve (EC) cryptographic processor architecture that can support Galois fields GF(p) and GF(2/sup n/) for arbitrary prime numbers and irreducible polynomials by introducing a
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
TLDR
The results show that implementations of this architecture executing the projective coordinates version of the Montgomery scalar multiplication algorithm can compute elliptic curve scalar multiplications with arbitrary points in 0.21 msec in the field GF(2167).
Hardware implementation of an elliptic curve processor over GF(p)
TLDR
A hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of public key cryptography (PKC) and RSA cryptosystems is described.
An improved Montgomery modular inversion targeted for efficient implementation on FPGA
TLDR
This work presents an improved algorithm for prime field Montgomery modular inversion, which achieves a ratio throughput/area improved by at least 70% compared to the only known Montgomery inverse design in FPGA technology.
Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
TLDR
For speeding-up an elliptic scalar multiplication, this work developed a novel configuration of a multiplier over GF(2m), which enables the multiplication of any bit length by using the data conversion method.
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
This work proposes a new elliptic curve processor architecture for the computation of point multiplication for curves defined over fields GF(p). This is a scalable architecture in terms of area and
New algorithm and fast VLSI implementation for modular inversion in Galois field GF(p)
TLDR
An improved algorithm for prime fields is presented for hardware facilitation and optimization that involves only ordinary addition/subtraction, and does not need any modular operations or multiplication and division.
A Fast Software Implementation for Arithmetic Operations in GF(2n)
TLDR
A software implementation of arithmetic operations in a finite field GF(2n), based on an alternative representation of the field elements that results in rather simple routines matching the structure of computer memory very well.
Scalable VLSI architecture for GF(p) Montgomery modular inverse computation
  • A. Gutub, A. Tenca, Ç. Koç
  • Computer Science, Mathematics
    Proceedings IEEE Computer Society Annual Symposium on VLSI. New Paradigms for VLSI Systems Design. ISVLSI 2002
  • 2002
TLDR
This work presents two VLSI hardware implementations used in the calculation of Montgomery modular inverse operation based on the same inversion algorithm, however, one is fixed (fully parallel) and the other is scalable.
Design and implementation of arithmetic processor F/sub 2//sup 155/ for elliptic curve cryptosystems
  • S. Sutikno, R. Effendi, A. Surya
  • Computer Science, Mathematics
    IEEE. APCCAS 1998. 1998 IEEE Asia-Pacific Conference on Circuits and Systems. Microelectronics and Integrating Systems. Proceedings (Cat. No.98EX242)
  • 1998
TLDR
This paper will describe how to design and implement an arithmetic processor with an efficient architecture and apply it to the elliptic curve cryptosystem.
...
1
2
3
...