Results 41 to 50 of about 2,741,809 (181)
Efficient Bit-Parallel Multiplier for All Trinomials Based on
IEEE Access, 2020 Recently, hybrid multiplication schemes over the binary extension field $GF(2^{m})$ based on $n$ -term Karatsuba algorithm (KA) have been proposed for irreducible trinomials.
Sun-Mi Park +3 more
doaj +1 more source
Speeding up the Karatsuba Algorithm
, 2019 This paper describes an $\sim {\cal O}(n)$ pre-compute technique to speed up the Karatsuba algorithm for multiplying two numbers.
Satish Ramakrishna, Kamesh Aiyer
openaire +4 more sources
Parallel Decimal Multipliers and Squarers Using Karatsuba-Ofman's Algorithm [PDF]
2012 15th Euromicro Conference on Digital System Design, 2012 Financial and commercial applications depend on decimal arithmetic since the results must match exactly those obtained by human calculations. Multiplication and squaring are frequently used operations in these applications. In this paper we propose to improve the efficiency of state-of-the-art decimal multipliers using the Karatsuba-Ofman's algorithm ...
Mário P. Véstias, Horácio C. Neto
openaire +3 more sources
Low Space Complexity
IEEE Access, 2019 We propose bit-parallel GF(2m) multipliers for irreducible trinomials using an n-term Karatsuba algorithm and Mastrovito approach, which are generalizations of the newly proposed multiplication scheme for a specific trinomial.
Sun-Mi Park +3 more
doaj +1 more source
Large Field-Size Throughput/Area Accelerator for Elliptic-Curve Point Multiplication on FPGA
Applied Sciences, 2023 This article presents a throughput/area accelerator for elliptic-curve point multiplication over GF(2571). To optimize the throughput, we proposed an efficient hardware accelerator architecture for a fully recursive Karatsuba multiplier to perform ...
Ahmed Alhomoud +5 more
doaj +1 more source
Compact implementations of Curve Ed448 on low‐end IoT platforms
ETRI Journal, 2019 Elliptic curve cryptography is a relatively lightweight public‐key cryptography method for key generation and digital signature verification. Some lightweight curves (eg, Curve25519 and Curve Ed448) have been adopted by upcoming Transport Layer Security ...
Hwajeong Seo
doaj +1 more source
Low latency Montgomery multiplier for cryptographic applications
Sir Syed University Research Journal of Engineering and Technology, 2021 In this modern era, data protection is very important. To achieve this, the data must be secured using either public-key or private-key cryptography (PKC). PKC eliminates the need of sharing key at the beginning of communication. PKC systems such as ECC
khalid javeed +3 more
doaj
A New Strategy to Design Reconfigurable Rivest–Shamir–Adleman (RSA) Accelerators
International Journal of Circuit Theory and Applications, Volume 54, Issue 6, Page 3043-3054, June 2026.A reconfigurable FPGA‐based RSA accelerator is proposed using compression‐based modular multipliers combined with pseudomoduli arithmetic. The approach maps modular exponentiation to low‐cost arithmetic domains and applies a correction stage, achieving significant improvements in delay, operating frequency, and delay–area efficiency compared with ...
Augusto C. B. Vassoler +4 more
wiley +1 more source
A Practical Energy/Power Reduction Approach for Parallel Decimal Multiplier
IEEE Access, 2022 Decimal computation is highly demanded in many human-centric applications such as banking, accounting, tax calculation, and currency conversion. Hence the design and implementation of radix-10 arithmetic units attract the attention of many researchers ...
Saeid Gorgin +2 more
doaj +1 more source
Diophantine tuples and product sets in shifted powers
Journal of the London Mathematical Society, Volume 113, Issue 3, March 2026.Abstract Let k⩾2$k\geqslant 2$ and n≠0$n\ne 0$. A Diophantine tuple with property Dk(n)$D_k(n)$ is a set of positive integers A$A$ such that ab+n$ab+n$ is a k$k$th power for all a,b∈A$a,b\in A$ with a≠b$a\ne b$. Such generalizations of classical Diophantine tuples have been studied extensively.
Ernie Croot, Chi Hoi Yip
wiley +1 more source