Results 11 to 20 of about 165,308 (288)
Parallel Integer Polynomial Multiplication [PDF]
2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2016 We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures.
Chen, Changbo +5 more
core +6 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
Multiplicity-Free Key Polynomials
Annals of Combinatorics, 2022 The key polynomials, defined by A. Lascoux-M.-P. Schützenberger, are characters for the Demazure modules of type A. We classify multiplicity-free key polynomials. The proof uses two combinatorial models for key polynomials. The first is due to A. Kohnert. The second is by S. Assaf-D. Searles, in terms of quasi-key polynomials.
Hodges, Reuven, Yong, Alexander
openaire +2 more sources
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
Slide Multiplicity Free Key Polynomials [PDF]
The Electronic Journal of Combinatorics, 2022 Schubert polynomials are refined by the key polynomials of Lascoux-Schützen-berger, which in turn are refined by the fundamental slide polynomials of Assaf-Searles. In this paper we determine which fundamental slide polynomial refinements of key polynomials, indexed by strong compositions, are multiplicity free.
Cho, Soojin, van Willigenburg, Stephanie
openaire +2 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
Essentially optimal sparse polynomial multiplication [PDF]
Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation, 2020 12 ...
Giorgi, Pascal +2 more
openaire +3 more sources