Results 101 to 110 of about 2,741,809 (181)

Abstract On fully parallel Karatsuba Multipliers for  ¢¡¤£¦¥¨§�©

, 2008
In this paper we present a new approach that generalizes the classic Karatsuba multiplier technique. In contrast with versions of this algorithm previously discussed [1, 2], in our approach we do not use composite fields to perform the ground field ...
F. Rodríguez-henríquez
core  

A Universal Single and Double Point Multiplications Architecture for ECDSA Based on Differential Addition Chains

IEEE Access
In the 5G and beyond networks, low-latency digital signatures are essential to ensure the security, integrity, and non-repudiation of massive data in communication processes. The binary finite field-based elliptic curve digital signature algorithm (ECDSA)
Xiang He, Weijiang Wang, Jingqi Zhang, Zhantao Zhang, Jianlei Yang, Hua Dang, Guiyu Wang   +6 more
doaj   +1 more source

Performance comparison of karatsuba and nikhilam multiplication algorithms for different bit lengths [PDF]

, 2015
Çarpma işlemi bilgisayar aritmetiğindeki en önemli işlemlerden biridir. Bölme, kare ve ters alma gibi birçok işlemde çarpma işlemi kullanılmaktadır. Ayrıca çarpma işleminin etkinliği korelasyon, filtreleme, frekans analizi ve görüntü işleme gibi dijital ...
Eyüpoğlu, Can, Sertbaş, Ahmet
core  

Hardware Addition Over Finite Fields Based On Booth–Karatsuba Algorithm

The Computer Journal
Abstract Two algorithms, both based around multiplication, one defined by Andrew Donald Booth in 1950 and the other defined by Anatoly Alexeevitch Karatsuba in 1960 can be applied to other types of operations. We know from recent results that to perform some algebraic transformations it is more efficient to calculate an inverse effect of
openaire   +2 more sources

Energy-Efficient Hardware Implementation of Fully Connected Artificial Neural Networks Using Approximate Arithmetic Blocks. [PDF]

Circuits Syst Signal Process, 2023
Esmali Nojehdeh M, Altun M.
europepmc   +1 more source

On a problem of Karatsuba

, 2010
We obtain lower bounds for the fractional moments of linear combinations of analogs of the Hardy function. In addition, we apply these estimates to the Karatsuba problem of finding a lower bound for the number of zeros of the linear combination of ...
S. A. Gritsenko, Gritsenko, S. A.
core   +1 more source

Karatsuba implementation of FIR filters

, 2012
In this paper, the authors propose the implementation of a programmable Finite Impulse Response (FIR) filter based on the use of the Karatsuba formula.
Cardarilli, G, Pontarelli, Salvatore, Cardarilli, Gian Carlo, Gian Carlo Cardarilli, Salvatore Pontarelli, Re, M, Albicocco, Pietro, Albicocco, P, Re, Marco, Pietro Albicocco, Marco Re, Pontarelli, S, Re M, Albicocco P, Cardarilli G, Pontarelli S   +15 more
core   +1 more source

Pipelined Key Switching Accelerator Architecture for CKKS-Based Fully Homomorphic Encryption. [PDF]

Sensors (Basel), 2023
Duong PN, Lee H.
europepmc   +1 more source

Post-Quantum Security: Opportunities and Challenges. [PDF]

Sensors (Basel), 2023
Li S, Chen Y, Chen L, Liao J, Kuang C, Li K, Liang W, Xiong N.   +7 more
europepmc   +1 more source

Improving the Karatsuba-Ofman multiplication algorithm for special applications

In this thesis, we study the Karatsuba-Ofman Algorithm (KOA), which is a recursive multi-precision multiplication method, and improve it for certain special applications. This thesis is in two parts.
Erdem, Serdar S.
core   +3 more sources