Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor

Tan, Tuy Nguyen; Lee, Hanho

doi:10.5573/jsts.2016.16.1.118

Cited by 23 publications

(25 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 6 shows steps for multiplication of two 3-digit decimal numbers using vertically and crosswise method and Figure 2 shows an alternative method for multiplication of two 4-digit using Urdhva-Tiryagbhyam sutra [4]. To demonstrate the working of a typical Vedic multiplication algorithm, consider the multiplication of two numbers m=42 and n= 21 to obtain o=m*n [12]. The following steps perform this:…”

Section: B1 Urdhva Tiryagbhyammentioning

confidence: 99%

See 1 more Smart Citation

A Novel Efficient Hardware Implementation of Elliptic Curve Cryptography Scalar Multiplication Using Vedic Multiplier

Kadu¹,

Adane²

2019

International Journal of Simulation: Systems, Science &Amp; Technology

View full text Add to dashboard Cite

We present an integrated circuit area efficient and high-speed FPGA implementation of scalar multiplication using a Vedic multiplier. Scalar multiplication is the most important operation in Elliptic Curve Cryptography (ECC), which is used for public key generation and the performance of ECC greatly depends on it. The scalar multiplier is designed over Galois Binary field GF(2 233) for field size=233-bit which is secured curve according to NIST. The performances of the proposed design are evaluated by comparing it with Karatsuba based scalar multiplier for area and delay. The results show that the proposed scalar multiplication using Vedic multiplier has consumed 22% less area on FPGA and has 12% less delay than Karatsuba, based scalar multiplier. The scalar multipliers coded in Verilog HDL, synthesize and simulated in Xilinx 13.2 ISE on Virtex6 FPGA.

show abstract

Section: B1 Urdhva Tiryagbhyammentioning

confidence: 99%

“…The architecture uses 3, 4 stage pipelining for ECSMA. In [5] [12] using different approaches and methods. In this paper, we propose the finite field multiplication operation using a Vedic multiplier for scalar multiplication.…”

Section: Introductionmentioning

confidence: 99%

A Novel Efficient Hardware Implementation of Elliptic Curve Cryptography Scalar Multiplication Using Vedic Multiplier

Kadu¹,

Adane²

2019

International Journal of Simulation: Systems, Science &Amp; Technology

View full text Add to dashboard Cite

show abstract

“…To implement PM operation, National Institute of Standards and Technology (NIST) have proposed a number of standard elliptic curves over the prime field GF(p) and binary extension field GF(2 m ) [3]. However, GF(2 m ) field is commonly used for efficient hardware implementations [4][5][6][7][8][9][10][11][12][13][14][15]. Furthermore, field-programmable-gate-array (FPGA) based designs of ECC are gaining more popularity due to the provision of its reconfigurability, availability (commonly available to everyone in the market) and shorter development time scales.…”

Section: Introductionmentioning

confidence: 99%

Throughput/area optimised pipelined architecture for elliptic curve crypto processor

Imran

Rashid

Jafri

et al. 2019

IET Computers & Digital Techniques

View full text Add to dashboard Cite

A pipelined architecture is proposed in this work to speed up the point multiplication in elliptic curve cryptography (ECC). This is achieved, at first; by pipelining the arithmetic unit to reduce the critical path delay. Second, by reducing the number of clock cycles (latency), which is achieved through careful scheduling of computations involved in point addition and point doubling. These two factors thus, help in reducing the time for one point multiplication computation. On the other hand, the small area overhead for this design gives a higher throughput/area ratio. Consequently, the proposed architecture is synthesised on different FPGAs to compare with the state-of-the-art. The synthesis results over GF(2 m) show that the proposed design can work up to a frequency of 369, 357 and 337 MHz when implemented for m = 163, 233 and 283 bit key lengths, respectively, on Virtex-7 FPGA. The corresponding throughput/slice figures are 42.22, 12.37 and 9.45, which outperform existing implementations.

show abstract

“…Lattice constructions also provide initial primitives for many cryptographic functionalities, e.g., fully homomorphic encryption [4]. With the same key size, lattice-based cryptographic algorithms can offer much higher secure compared with conventional public-key algorithms, such as the Rivest-Shamir-Adleman (RSA) cryptosystem [5], or Elliptic Curve Cryptography (ECC) algorithms [6].…”

Section: Introductionmentioning

confidence: 99%

Efficient NewHope Cryptography Based Facial Security System on a GPU

2020

Self Cite

View full text Add to dashboard Cite

With explosive era of machine learning development, human data, such as biometric images, videos, and particularly facial information, have become an essential training resource. The popularity of video surveillance systems and growing use of facial images have increased the risk of leaking personal information. On the other hand, traditional cryptography systems are still expensive, time consuming, and low security, leading to be threatened by the foreseeable attacks of quantum computers. This paper proposes a novel approach to fully protect facial images extracted from videos based on a post-quantum cryptosystem named NewHope cryptography. Applying the proposed technique to arrange input data for encryption and decryption processes significantly reduces encryption and decryption times. The proposed facial security system was successfully accelerated using data-parallel computing model on the recently launched Nvidia GTX 2080Ti Graphics Processing Unit (GPU). Average face frame extracted from video (190 × 190 pixel) required only 2.2 ms and 2.7 ms total encryption and decryption times with security parameters n = 1024 and n = 2048, respectively, which is approximately 9 times faster than previous approaches. Analysis results of security criteria proved that the proposed system offered comparable confidentiality to previous systems. INDEX TERMS cryptosystem, facial security system, graphics processing unit, NewHope, public-key encryption.

show abstract

Efficient Algorithm and Architecture for Elliptic Curve Cryptographic Processor

Cited by 23 publications

References 17 publications

A Novel Efficient Hardware Implementation of Elliptic Curve Cryptography Scalar Multiplication Using Vedic Multiplier

A Novel Efficient Hardware Implementation of Elliptic Curve Cryptography Scalar Multiplication Using Vedic Multiplier

Throughput/area optimised pipelined architecture for elliptic curve crypto processor

Efficient NewHope Cryptography Based Facial Security System on a GPU

Contact Info

Product

Resources

About