Results 71 to 80 of about 2,741,809 (181)
Implementation of Multidigit Multiplication Basing on Discrete Cosine and Sine Transforms
Кібернетика та комп'ютерні технології, 2021 Introduction. The emergence of new parallel computing systems such as multi-core processors, clusters, distributed systems, due to the solution of various applications in different spheres.
Andrii Tereshchenko, Valeriy Zadiraka
doaj +1 more source
Fast polynomial arithmetic for Somewhat Homomorphic Encryption operations in hardware with Karatsuba algorithm [PDF]
2016 International Conference on Field-Programmable Technology (FPT), 2016 Somewhat Homomorphic Encryption (SHE) schemes allow to carry out operations on data in the cipher domain. In a cloud computing scenario, personal information can be processed secretly, inferring a high level of confidentiality. Most practical Somewhat Homomorphic Encryption (SHE) schemes require the implementation of fast polynomial arithmetic, that is
Migliore, Vincent +5 more
openaire +1 more source
, 2023 Here, we present a modified version of the Karatsuba algorithm to facilitate the FPGA-based implementation of three signed multipliers: 32-bit × 32-bit, 128-bit x 128-bit, and 512-bit × 512-bit.
Andrew Walder, IJRES
core +1 more source
Integration in CNN and FIR filters for improved computational efficiency in signal processing
Ain Shams Engineering JournalThis research paper explains the design process of the 8 × 8 Vedic multipliers based on the “UrdhvaTiryagbhyam” Sutra in combination with the “Nikhilam Sutra“ and the Karatsuba algorithm.
A. Sridevi, A. Sathiya
doaj +1 more source
Mastrovito Form of Non-recursive Karatsuba Multiplier for All Trinomials [PDF]
, 2017 We present a new type of bit-parallel non-recursive Karatsuba multiplier over $GF(2^m)$ generated by an arbitrary irreducible trinomial. This design effectively exploits Mastrovito approach and shifted polynomial basis (SPB) to reduce the time complexity
Chuanda Qi, Xingpo Ma, Yin Li, Yu Zhang
core +1 more source
Flexible and Scalable FPGA-Oriented Design of Multipliers for Large Binary Polynomials
IEEE Access, 2020 With the recent advances in quantum computing, code-based cryptography is foreseen to be one of the few mathematical solutions to design quantum resistant public-key cryptosystems.
Davide Zoni +2 more
doaj +1 more source
Karatsuba with Rectangular Multipliers for FPGAs [PDF]
, 2018 Best paper awardInternational audienceThis work presents an extension of Karatsuba's method to efficiently use rectangular multipliers as a base for larger multipliers. The rectangular multipliers that motivate this work are the embedded 18×25-bit signed
Gustafsson, Oscar +14 more
core +1 more source
Square a Multi-Digit Number on 8 Processors in a Parallel Computational Model
Кібернетика та комп'ютерні технологіїIntroduction. Currently, data security and confidentiality are becoming an urgent challenge not only for individuals, but also at the state level. The level of cyberattacks has grown to such an extent that hackers can disable servers, change data in ...
Andrii Tereshchenko
doaj +1 more source
Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
Journal of Applied Mathematics, 2014 Public-key cryptosystems are broadly employed to provide security for digital information. Improving the efficiency of public-key cryptosystem through speeding up calculation and using fewer resources are among the main goals of cryptography research. In
Shahram Jahani +2 more
doaj +1 more source
A High-performance Hardware Implementation of Saber Based on Karatsuba Algorithm
, 2021 Although large numbers of hardware and software implementations have been proposed to accelerate lattice-based cryptography, Saber, a module-LWR-based algorithm, which has advanced to second round of the NIST standardization process, has not been ...
Chenchen Deng +7 more
core +1 more source