Results 51 to 60 of about 2,741,809 (181)
Efficient Nonrecursive Bit‐Parallel Karatsuba Multiplier for a Special Class of Trinomials
VLSI Design, Volume 2018, Issue 1, 2018., 2018 Recently, we present a novel Mastrovito form of nonrecursive Karatsuba multiplier for all trinomials. Specifically, we found that related Mastrovito matrix is very simple for equally spaced trinomial (EST) combined with classic Karatsuba algorithm (KA), which leads to a highly efficient Karatsuba multiplier.
Yin Li +3 more
wiley +1 more source
From Multiplication to Recovery: A Single-trace Side-Channel Attack on HQC
Transactions on Cryptographic Hardware and Embedded SystemsHamming Quasi-Cyclic (HQC) has been selected by NIST as a standard for code-based Post-Quantum Cryptography (PQC) Key Encapsulation Mechanisms (KEMs). While HQC offers robust theoretical security based on the Decisional Quasi- Cyclic Syndrome Decoding ...
Yikang Guo +6 more
doaj +1 more source
Quantum Implementation of S‐Boxes Based on Polynomial Evaluation
Electronics Letters, Volume 61, Issue 1, January/December 2025.ABSTRACT Quantum computing environments make block ciphers susceptible to exhaustive key search attacks utilizing Grover's algorithm. However, such quantum‐based attacks remain impractical unless the targeted cipher is directly implemented on a quantum platform.
Doyoung Chung, Seungkwang Lee
wiley +1 more source
Security and Communication Networks, Volume 2018, Issue 1, 2018., 2018 Quantum computers have the potential to solve some difficult mathematical problems efficiently and thus will inevitably exert a more significant impact on the traditional asymmetric cryptography. The National Institute of Standards and Technology (NIST) has opened a formal call for the submission of proposals of quantum‐resistant public‐key ...
Ye Yuan +5 more
wiley +1 more source
Comments on “five, Six, and Seven-Term Karatsuba-Like Formulae
, 2007 We show that multiplication complexities of n-term Karatsuba-Like formulae of GF (2)[x] (7 < n < 19) presented in the above paper can be further improved using the Chinese Remainder Theorem and the construction multiplication modulo (x − ∞) w ...
Haining Fan +3 more
core +1 more source
Cryptography, 2023 The Number Theoretic Transform (NTT) has been widely used to speed up polynomial multiplication in lattice-based post-quantum algorithms. All NTT operands use modular arithmetic, especially modular multiplication, which significantly influences NTT ...
Trong-Hung Nguyen +2 more
doaj +1 more source
A survey on post‐quantum based approaches for edge computing security
WIREs Computational Statistics, Volume 16, Issue 1, January/February 2024.The distribution of reviewed papers by focused area. Abstract With the development of technology and its integration with scientific realities, computer systems continue to evolve as infrastructure. One of the most important obstacles in front of quantum computers with high‐speed processing is that its existing systems cause security vulnerabilities ...
Aykut Karakaya, Ahmet Ulu
wiley +1 more source
Time efficient signed Vedic multiplier using redundant binary representation
The Journal of Engineering, Volume 2017, Issue 3, Page 60-68, March 2017., 2017 This study presents a high‐speed signed Vedic multiplier (SVM) architecture using redundant binary (RB) representation in Urdhva Tiryagbhyam (UT) sutra. This is the first ever effort towards extension of Vedic algorithms to the signed numbers. The proposed multiplier architecture solves the carry propagation issue in UT sutra, as carry free addition is
Ranjan Kumar Barik +2 more
wiley +1 more source
Karatsuba-Ofman Multiplier with Integrated Modular Reduction for (2m ) [PDF]
, 2013 In this paper a novel GF(2m) multiplier based on Karatsuba-Ofman Algorithm is presented. A binary field multiplication in polynomial basis is typically viewed as a two steps process, a polynomial multiplication followed by a modular reduction step.
ALICIA MORALES REYES +6 more
core
Symmetric Encryption Algorithms in a Polynomial Residue Number System
Journal of Applied Mathematics, Volume 2024, Issue 1, 2024.In this paper, we develop the theoretical provisions of symmetric cryptographic algorithms based on the polynomial residue number system for the first time. The main feature of the proposed approach is that when reconstructing the polynomial based on the method of undetermined coefficients, multiplication is performed not on the found base numbers but ...
I. Yakymenko +4 more
wiley +1 more source