Results 11 to 20 of about 5,753 (265)
On the ω-multiple Charlier polynomials [PDF]
Advances in Difference Equations, 2021 AbstractThe main aim of this paper is to define and investigate more general multiple Charlier polynomials on the linear lattice $\omega \mathbb{N} = \{ 0,\omega ,2\omega ,\ldots \} $ ω N = { 0 , ω ,
Ozarslan, Mehmet Ali, Baran, Gizem
openaire +3 more sources
Neon NTT: Faster Dilithium, Kyber, and Saber on Cortex-A72 and Apple M1
Transactions on Cryptographic Hardware and Embedded Systems, 2021 We present new speed records on the Armv8-A architecture for the latticebased schemes Dilithium, Kyber, and Saber. The core novelty in this paper is the combination of Montgomery multiplication and Barrett reduction resulting in “Barrett multiplication ...
Hanno Becker +4 more
doaj +1 more source
Kavach: Lightweight masking techniques for polynomial arithmetic in lattice-based cryptography
Transactions on Cryptographic Hardware and Embedded Systems, 2023 Lattice-based cryptography has laid the foundation of various modern-day cryptosystems that cater to several applications, including post-quantum cryptography. For structured lattice-based schemes, polynomial arithmetic is a fundamental part. In several
Aikata Aikata +4 more
doaj +1 more source
Polynomial Multiplication in NTRU Prime
Transactions on Cryptographic Hardware and Embedded Systems, 2020 This paper proposes two different methods to perform NTT-based polynomial multiplication in polynomial rings that do not naturally support such a multiplication. We demonstrate these methods on the NTRU Prime key-encapsulation mechanism (KEM) proposed by
Erdem Alkim +10 more
doaj +3 more sources
NTT Multiplication for NTT-unfriendly Rings
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, we show how multiplication for polynomial rings used in the NIST PQC finalists Saber and NTRU can be efficiently implemented using the Number-theoretic transform (NTT).
Chi-Ming Marvin Chung +5 more
doaj +1 more source
Multiplicity of zeros of polynomials [PDF]
Journal of Approximation Theory, 2021 The paper grew out of the known result of \textit{P. Erdős} and \textit{P. Túran} [Ann. Math. (2) 41, 162--173 (1940; Zbl 0023.02201)] on zero distributions and bounds for their multiplicities of monic polynomials with all their zeros in \([-1,1]\). Theorem 1.1.
openaire +3 more sources
IEEE Access, 2022 Falcon is one of the promising digital-signature algorithms in NIST’s ongoing Post-Quantum Cryptography (PQC) standardization finalist. Computational efficiency regarding software and hardware is also the main criteria for PQC standardization.
Youngbeom Kim +2 more
doaj +1 more source
Polynomial multiplication on embedded vector architectures
Transactions on Cryptographic Hardware and Embedded Systems, 2021 High-degree, low-precision polynomial arithmetic is a fundamental computational primitive underlying structured lattice based cryptography. Its algorithmic properties and suitability for implementation on different compute platforms is an active area of ...
Hanno Becker +4 more
doaj +1 more source
IEEE Access, 2022 Polynomial multiplication is one of the heaviest operations for a lattice-based public key algorithm in Post-Quantum Cryptography (PQC). Many studies have been done to accelerate polynomial multiplication with newly developed hardware accelerators or ...
Jong-Yeon Park +4 more
doaj +1 more source
Fast Multiplication for Skew Polynomials [PDF]
Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation, 2017 We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our algorithms improve the best known complexity for these problems, and reach the optimal asymptotic complexity bound for ...
Xavier Caruso, Jérémy Le Borgne
openaire +4 more sources