• Corpus ID: 122745394

# Hardware Elliptic Curve Cryptographic Processor Over

@inproceedings{McIvor2006HardwareEC,
title={Hardware Elliptic Curve Cryptographic Processor Over},
author={Ciaran McIvor and M{\'a}ire McLoone and John V. McCanny},
year={2006}
}
• Published 2006
• Computer Science
Flexible Hardware Processor for Elliptic Curve Cryptography Over NIST Prime Fields
• Computer Science, Mathematics
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
• 2009
This work describes a flexible hardware processor for performing computationally expensive modular addition, subtraction, multiplication, and inversion over prime finite fields GF(p) .
A High-Speed and SPA-Resistant Implementation of ECC Point Multiplication Over GF(p)
• Computer Science, Mathematics
2017 IEEE Trustcom/BigDataSE/ICESS
• 2017
A new Karatsuba-Ofman based pipelined multiplier is proposed to lower the latency, and an improved comb point multiplication method is employed to reduce the clock cycles and to resist simple power analysis (SPA).
A High-Performance Elliptic Curve Cryptographic Processor for General Curves Over ${\rm GF}(p)$ Based on a Systolic Arithmetic Unit
• Computer Science
IEEE Transactions on Circuits and Systems II: Express Briefs
• 2007
A new unified systolic array is proposed that efficiently implements addition, subtraction, multiplication and division over GF(p) by using a high-performance elliptic curve cryptographic processor, which features a syStolic arithmetic unit.
A Comparative Study of Image Steganography and Text Cryptography
• Computer Science, Mathematics
• 2019
The more complex the mathematical model is, the safer and effective will be the cryptographic data.
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
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.
FPGA Implementation of High-Speed Area-Efficient Processor for Elliptic Curve Point Multiplication Over Prime Field
• Computer Science, Mathematics
IEEE Access
• 2019
Developing a high-speed elliptic curve cryptographic (ECC) processor that performs fast point multiplication with low hardware utilization is a crucial demand in the fields of cryptography and
FPGA Implementation of Present Algorithm with Improved Security
• Computer Science, Mathematics
2019 3rd International conference on Electronics, Communication and Aerospace Technology (ICECA)
• 2019
The prime focus of this paper is to consider the variety of hardware architectures of a lightweight cipher PRESENT, which acquired its fame as a resource conservator as well as a tough cipher that can be used in Home automation and IoT related devices.
High Performance SM2 Elliptic Curve Cryptographic Processor over GF(p)
• Computer Science
2019 Chinese Control Conference (CCC)
• 2019
A two-stage fast-reduction (TSFR) algorithm over SCA-256 prime field is proposed, which can obtain the result of "0 \leq Z \lt 2p$instead of$0\leqZ \lt 14p\$ of traditional algorithm.
Privacy-preserving encoding for cloud computing
A solution for the cloud that offers privacy-preserving data computation but provides performance and flexibility is designed, where the combination of encoding and distribution helps provide the balance between security, performance and utility.
-1 multiplier Based on Radix-8 Booth Algorithm using Residue Number System
The first-ever family of low-area and low-power radix-8 Booth encoded modulo 2 n 1 multiplier whose delay can be tuned to match the RNS delay closely has been proposed in this paper.

## References

SHOWING 1-10 OF 22 REFERENCES
An algorithm and hardware architecture for integrated modular division and multiplication in GF(p) and GF(2/sup n/)
• Computer Science
• 2004
This work presents an algorithm and architecture that integrates modular division and multiplication in both GF(p) and GF(2/sup n/) fields (unified) and uses carry-save unified adders for reduced critical path delay, making the proposed architecture faster than other previously proposed designs.
An improved Montgomery modular inversion targeted for efficient implementation on FPGA
• Computer Science, Mathematics
Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921)
• 2004
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.
A Scalable Dual-Field Elliptic Curve Cryptographic Processor
• Computer Science, Mathematics
IEEE Trans. Computers
• 2003
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
Hardware implementation of an elliptic curve processor over GF(p)
• Mathematics, Computer Science
Proceedings IEEE International Conference on Application-Specific Systems, Architectures, and Processors. ASAP 2003
• 2003
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.
New algorithm and fast VLSI implementation for modular inversion in Galois field GF(p)
• Computer Science
IEEE 2002 International Conference on Communications, Circuits and Systems and West Sino Expositions
• 2002
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 High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
• Computer Science, Mathematics
CHES
• 2000
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).
Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
• Computer Science, Mathematics
CHES
• 2000
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.
The Montgomery Modular Inverse-Revisited
• Mathematics, Computer Science
IEEE Trans. Computers
• 2000
A new definition of the Montgomery inverse is given, and efficient algorithms for computing the classical modular inverse, the Kaliski-Montgomery inverse, and the new Montgomery inverse are introduced.
Montgomery exponentiation needs no final subtractions
Montgomery's modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. It has been observed that there is no need for extra cleaning up at the end of an
Playing "Hide and Seek" with Stored Keys
• Computer Science, Mathematics
Financial Cryptography
• 1999
Efficient algebraic attacks which can locate secret RSA keys in long bit strings are described, and more general statistical attacks are described which can find arbitrary cryptographic keys embedded in large programs.