ATP-Optimized Four-Term Karatsuba Multipliers for Large Integer Arithmetic on FPGAs

This work presents two methods of hardware implementation of area-time-product (ATP)-optimized four-term Karatsuba multipliers (FTKM) on Field Programmable Gate Arrays (FPGAs). This is done by eliminating the effects of complexity of sub-multiplications present at the intermediate steps of computation. Besides these, hardware implementation of the proposed work suggests that the proposed FTKM multiplication methods (FTKM-I and FTKM-II) performs better in terms of resource utilization and delay minimization compared to other existing state-of-the-art multiplication methods, irrespective of input bit lengths. Hardware implementations of the proposed FTKM methods (FTKM-I and FTKM-II) multiplication architecture are demonstrated on a Virtex-7 FPGA device in Xilinx ISE platform. Here, the hardware implementation of the proposed FTKM multipliers is carried out for 128 bits, 256 bits, 512 bits, and 1024 bits, showcasing advantages in area-time-product (ATP) over previous research. ATP serves as the Figure-of-Merit (FoM) for determining the performance of the design.

Authors

Institutions

Publication Details

Published
2024-08-08
DOI
https://doi.org/10.1109/icecsp61809.2024.10698504
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ATP-Optimized Four-Term Karatsuba Multipliers for Large Integer Arithmetic on FPGAs

Sumit Kumar, Shubham Singh, Babita Jajodia, Monalisa Das et al.
Coding theory and cryptography
article

ATP-Optimized Four-Term Karatsuba Multipliers for Large Integer Arithmetic on FPGAs

Sumit Kumar, Shubham Singh, Babita Jajodia, Monalisa Das, Saubi Patel
article en

Abstract

This work presents two methods of hardware implementation of area-time-product (ATP)-optimized four-term Karatsuba multipliers (FTKM) on Field Programmable Gate Arrays (FPGAs). This is done by eliminating the effects of complexity of sub-multiplications present at the intermediate steps of computation. Besides these, hardware implementation of the proposed work suggests that the proposed FTKM multiplication methods (FTKM-I and FTKM-II) performs better in terms of resource utilization and delay minimization compared to other existing state-of-the-art multiplication methods, irrespective of input bit lengths. Hardware implementations of the proposed FTKM methods (FTKM-I and FTKM-II) multiplication architecture are demonstrated on a Virtex-7 FPGA device in Xilinx ISE platform. Here, the hardware implementation of the proposed FTKM multipliers is carried out for 128 bits, 256 bits, 512 bits, and 1024 bits, showcasing advantages in area-time-product (ATP) over previous research. ATP serves as the Figure-of-Merit (FoM) for determining the performance of the design.

Indian Institute of Information Technology Guwahati (IN)
Openalex Percentile: Top 85%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.