[vc_empty_space][vc_empty_space]
Optimized VHDL-based Karatsuba polynomial multiplier generator for GF(2n)
Santriaji M.H.a, Sasongko A.a
a School of Electrical and Informatic Engineering, Institut Teknologi Bandung, Bandung, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2015 IEEE.Polynomial multiplication is the most significant operation in Elliptic Curve Cryptography (ECC). ECC is implemented in interactive application, which means the latency performance must obey some standards and constraints. When implemented in this kind of application, designer shouldn’t set the performance as fast as possible but just fast enough to preserve the application constrains so the area can be reduced. However, finding the best tradeoff between area/performance requires tedious and time consuming efforts. In this paper, we propose an autonomous method to find the most efficient area/performance trade-off for polynomial multiplication. First, it finds the least computational cost for polynomial multiplication using Karatsuba algorithm. Then, it would search the least area cost by sequencing the multiplication inside the karatsuba algorithm. Last, it would generate a VHDL code that ready to be used. This method is not only useful to find near optimal area/performance trade-off, but also it shortens the design cycle for embedded system design.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Computational costs,Design cycle,Elliptic Curve Cryptography(ECC),Interactive applications,Karatsuba algorithm,Latency performance,Near-optimal,Polynomial multiplication[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ISPACS.2015.7432779[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]