Results 31 to 40 of about 6,241 (212)

High-speed Instruction-set Coprocessor for Lattice-based Key Encapsulation Mechanism: Saber in Hardware

Transactions on Cryptographic Hardware and Embedded Systems, 2020
In this paper, we present an instruction set coprocessor architecture for lattice-based cryptography and implement the module lattice-based post-quantum key encapsulation mechanism (KEM) Saber as a case study.
Sujoy Sinha Roy, Andrea Basso
doaj   +1 more source

Polynomial degree reduction in the L2-norm on a symmetric interval for the canonical basis

Results in Applied Mathematics, 2021
In this paper, we develop a direct formula for determining the coefficients in the canonical basis of the best polynomial of degree M that approximates a polynomial of degree N>Mon a symmetric interval for the L2-norm.
Habib Ben Abdallah, Christopher J. Henry, Sheela Ramanna   +2 more
doaj   +1 more source

Karatsuba-Ofman Multiplier with Integrated Modular Reduction for GF(2m)

Advances in Electrical and Computer Engineering, 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 ...
CUEVAS-FARFAN, E., MORALES-SANDOVAL, M., MORALES-REYES, A., FEREGRINO-URIBE, C., ALGREDO-BADILLO, I., KITSOS, P., CUMPLIDO, R.   +6 more
doaj   +1 more source

On the Multiplication of Schubert Polynomials

Advances in Applied Mathematics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Polynomials and the exponent of matrix multiplication

Bulletin of the London Mathematical Society, 2018
14 pages + appendix of 3 pages with numerical ...
Luca Chiantini, Jon Hauenstein, Christian Ikenmeyer, Joseph Landsberg, Giorgio Ottaviani   +4 more
openaire   +7 more sources

Multiplying Polynomials without Powerful Multiplication Instructions

Transactions on Cryptographic Hardware and Embedded Systems
We improve the performance of lattice-based cryptosystems Dilithium on Cortex-M3 with expensive multiplications. Our contribution is two-fold: (i) We generalize Barrett multiplication and show that the resulting shape-independent modular multiplication ...
Vincent Hwang, YoungBeom Kim, Seog Chung Seo   +2 more
doaj   +1 more source

Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography

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, Angshuman Karmakar, Ingrid Verbauwhede   +2 more
doaj   +1 more source

The computation of multiple roots of a polynomial

Journal of Computational and Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joab R. Winkler, Xin Lao, Madina Hasan
openaire   +1 more source

PPSC: High-Precision and Scalable Encrypted Privacy-Preserving Speech Classification [PDF]

Jisuanji kexue yu tansuo
To address the challenges of low computational efficiency and classification accuracy in existing fully homomorphic encryption technology for speech classification tasks, a high-precision and scalable encrypted privacy-preserving speech classification ...
WANG Leilei, SONG Kao, ZHANG Yuanyuan, BI Renwan, XIONG Jinbo
doaj   +1 more source

A New Trick for Polynomial Multiplication

Transactions on Cryptographic Hardware and Embedded Systems
In this paper we present a novel transformation strategy for polynomial multiplications and apply it to NTRU Prime, specifically the parameter sets sntrup761 and ntrulpr761 working in the ring Z4591[x]/⟨x761−x−1⟩.
Chun-Ming Chiu, Bo-Yin Yang, Bow-Yaw Wang   +2 more
doaj   +1 more source