In this paper, we propose an elliptic curve key generation processor over GF(2163) scheme based on the Montgomery scalar multiplication algorithm. The new architecture is performed using polynomial basis. The Finite Field operations use a cellular automata multiplier and Fermat algorithm for inversion. For real time implementation, the architecture has been tested on an ISE 9.1 Software using Xilinx Virtex II Pro FPGA and on an ASIC CMOS 45 nm technology as well. The proposed implementation provides a time of 2.07 ms and 38 percent of Slices in Xilinx Virtex II Pro FPGA. Such features reveal the high efficiently of this implementation design
This paper proposes a hardware-efficient elliptic curve cryptography (ECC) architecture over GF(p), ...
The architecture and the implementation of a high-performance scalable elliptic curve cryptography p...
This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over bina...
This paper presents an elliptic curve cryptography processor for prime fields implemented on a FPGA-...
Nowadays, elliptic curve cryptosystems are widely distributed. Its fundamental operation is scalar m...
The higher computational complexity of an elliptic curve scalar point multiplication operation limit...
Abstract. The strength of ECC lies in the hardness of elliptic curve discrete logarithm problem (ECD...
This work presents the implementation of a tightly-coupled hardware architectural enhancement to the...
Abstract: In this paper, we present an Elliptic Curve Point Multiplication processor over base Field...
Elliptic curve cryptography (ECC) plays a vital role in pabing secure information among different wi...
This paper details the design of a new high-speed pipelined application-specific instruction set pro...
Elliptic curve cryptography (ECC) offers a viable alternative to Rivest-Shamir-Adleman (RSA) by deli...
This paper describes a hardware implementation of an arithmetic processor which is efficient for bit...
Empirical thesis.Bibliography: pages 91-92.1. Introduction -- 2. Background and related work -- 3. E...
The high performance of an elliptic curve (EC) crypto system depends efficiently on the arithmetic i...
This paper proposes a hardware-efficient elliptic curve cryptography (ECC) architecture over GF(p), ...
The architecture and the implementation of a high-performance scalable elliptic curve cryptography p...
This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over bina...
This paper presents an elliptic curve cryptography processor for prime fields implemented on a FPGA-...
Nowadays, elliptic curve cryptosystems are widely distributed. Its fundamental operation is scalar m...
The higher computational complexity of an elliptic curve scalar point multiplication operation limit...
Abstract. The strength of ECC lies in the hardness of elliptic curve discrete logarithm problem (ECD...
This work presents the implementation of a tightly-coupled hardware architectural enhancement to the...
Abstract: In this paper, we present an Elliptic Curve Point Multiplication processor over base Field...
Elliptic curve cryptography (ECC) plays a vital role in pabing secure information among different wi...
This paper details the design of a new high-speed pipelined application-specific instruction set pro...
Elliptic curve cryptography (ECC) offers a viable alternative to Rivest-Shamir-Adleman (RSA) by deli...
This paper describes a hardware implementation of an arithmetic processor which is efficient for bit...
Empirical thesis.Bibliography: pages 91-92.1. Introduction -- 2. Background and related work -- 3. E...
The high performance of an elliptic curve (EC) crypto system depends efficiently on the arithmetic i...
This paper proposes a hardware-efficient elliptic curve cryptography (ECC) architecture over GF(p), ...
The architecture and the implementation of a high-performance scalable elliptic curve cryptography p...
This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over bina...