Results 41 to 50 of about 165,252 (290)

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

open access: yesTransactions 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

Multiplying Polynomials without Powerful Multiplication Instructions

open access: yesTransactions 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   +2 more
doaj   +1 more source

Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes [PDF]

open access: yes, 2017
This paper compares the efficiency of various algorithms for implementing quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several ...
Wang, Yongge
core   +1 more source

Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix [PDF]

open access: yes, 2005
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree d over a field K we give a rank and nullspace algorithm using about the same ...
Storjohann, Arne, Villard, Gilles
core   +7 more sources

Characterization of Defect Distribution in an Additively Manufactured AlSi10Mg as a Function of Processing Parameters and Correlations with Extreme Value Statistics

open access: yesAdvanced Engineering Materials, EarlyView.
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt   +8 more
wiley   +1 more source

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

open access: yesJisuanji 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

FPGA-Based Hardware Accelerator for Leveled Ring-LWE Fully Homomorphic Encryption

open access: yesIEEE Access, 2020
Fully homomorphic encryption (FHE) allows arbitrary computation on encrypted data and has great potential in privacy-preserving cloud computing and securely outsource computational tasks.
Yang Su   +3 more
doaj   +1 more source

Hybrid Auxetic Architectures: Integrating Curvature‐Driven Design for Enhanced Mechanical Tunability and Structural Performance

open access: yesAdvanced Engineering Materials, EarlyView.
Curvature‐tuned auxetic lattices are designed, fabricated, and mechanically characterized to reveal how geometric curvature governs stretchability, stress redistribution, and Poisson's ratio evolution. Photoelastic experiments visualize stress pathways, while hyperelastic simulations quantify deformation mechanics.
Shuvodeep De   +3 more
wiley   +1 more source

A New Trick for Polynomial Multiplication

open access: yesTransactions 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   +2 more
doaj   +1 more source

Straggler- and Adversary-Tolerant Secure Distributed Matrix Multiplication Using Polynomial Codes

open access: yesEntropy, 2023
Large matrix multiplications commonly take place in large-scale machine-learning applications. Often, the sheer size of these matrices prevent carrying out the multiplication at a single server.
Eimear Byrne   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy