Results 61 to 70 of about 2,741,809 (181)
GPU-oriented implementation and optimization of Karatsuba–NTT polynomial multiplication
Journal of King Saud University: Computer and Information SciencesPolynomial multiplication serves as a fundamental computational primitive in modern cryptography–including fully homomorphic encryption and zero-knowledge proofs –as well as in digital signal processing.
Ruwei Huang +3 more
doaj +1 more source
Innovative Dual-Binary-Field Architecture for Point Multiplication of Elliptic Curve Cryptography
IEEE Access, 2021 High-performance Elliptic Curve Cryptography (ECC) implementation in encryption authentication severs has become a challenge due to the explosive growth of e-commerce’s demand for speed and security.
Jiakun Li +4 more
doaj +1 more source
Partially Interleaved Modular Karatsuba-Ofman Multiplication
, 2015 We describe a method of performing modular multiplication that has various applications in the field of modern cryptography and coding theory. The proposed algorithm, which combines the Karatsuba-Ofman multiplier and bipartite modular reduction, presents
Saldamli, Gokay +2 more
core +1 more source
PAGE—Practical AES-GCM Encryption for Low-End Microcontrollers
Applied Sciences, 2020 An optimized AES (Advanced Encryption Standard) implementation of Galois Counter Mode of operation (GCM) on low-end microcontrollers is presented in this paper. Two optimization methods are applied to proposed implementations. First, the AES counter (CTR)
Kyungho Kim +5 more
doaj +1 more source
Journal of Symbolic Computation, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giovanni Cesari, Roman Maeder
openaire +3 more sources
Tongxin xuebao, 2022 Aiming at the high performance requirements of signature verification for specific scenarios such as blockchain, a high-speed hardware architecture of Ed25519 was proposed.To reduce the number of calculations for point addition and point double, a ...
Yiming XUE +4 more
doaj +2 more sources
Transactions on Cryptographic Hardware and Embedded Systems, 2020 Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively.
Jose Maria Bermudo Mera +2 more
doaj +1 more source
Space and Time-Efficient Quantum Multiplier in Post Quantum Cryptography Era
IEEE Access, 2023 This paper examines the asymptotic performance of multiplication and the cost of quantum implementation for the Naive schoolbook, Karatsuba, and Toom-Cook methods in the classical and quantum cases and provides insights into multiplication roles in the ...
Dedy Septono Catur Putranto +3 more
doaj +1 more source
Practical Integer Division with Karatsuba Complexity
, 1997 Combining Karatsuba multiplication with a technique developed by Krandick for computing the high-order part of the quotient, we obtain an integer division algorithm which is only two times slower, on average, than Karatsuba multiplication.
Tudor Jebelean
core +1 more source
Fast hybrid Karatsuba multiplier for Type II pentanomials [PDF]
, 2020 We continue the study of Mastrovito form of Karatsuba multipliers under the shifted polynomial basis (SPB), recently introduced by Li et al. (IEEE TC (2017)).
Yin Li, Wei He, Yu Zhang
core +1 more source