Results 51 to 60 of about 6,241 (212)
A Bootstrapping-Capable Configurable NTT Architecture for Fully Homomorphic Encryption
IEEE AccessFully homomorphic encryption (FHE) provides a solution to privacy-preserving applications because of its ability to perform computations on encrypted data without exposing raw data.
Rella Mareta +3 more
doaj +1 more source
A New Secret Sharing Scheme Based on Polynomials over Finite Fields
Mathematics, 2020 In this paper, we examine a secret sharing scheme based on polynomials over finite fields. In the presented scheme, the shares can be used for the reconstruction of the secret using polynomial multiplication. This scheme is both ideal and perfect.
Selda Çalkavur +2 more
doaj +1 more source
Homogeneous Polynomials with a Multiplication Theorem [PDF]
Transactions of the American Mathematical Society, 1929 This was known to Diophantus.t Euler and Degen noticed that, similarly, a sum of n squares admits composition when n = 4 or 8, and Hurwitzt proved that such is true only when n= 1, 2, 4, 8. Two other well known examples are the multiplication theorem for determinants whose n2 elements are independent variables and the norms of algebraic numbers ...
openaire +1 more source
Asymptotics for multiple Meixner polynomials
Journal of Mathematical Analysis and Applications, 2014 The n-root asymptotic behavior of multiple Meixner polynomials is studied. A method based on an algebraic function formulation in connection with some available techniques from logarithmic potential theory has been developed. It represents an alternative to the use of Riemann-Hilbert techniques and the steepest descent method for oscillatory RH ...
Aptekarev, A. I. +1 more
openaire +3 more sources
Pieri-type multiplication formula for quantum Grothendieck polynomials [PDF]
, 2022 Satoshi Naito, Daisuke Sagaki
openalex +1 more source
High-Speed NTT Accelerator for CRYSTAL-Kyber and CRYSTAL-Dilithium
IEEE AccessThe efficiency of polynomial multiplication execution majorly impacts the performance of lattice-based post-quantum cryptosystems. In this research, we propose a high-speed hardware architecture to accelerate polynomial multiplication based on the Number
Trong-Hung Nguyen +3 more
doaj +1 more source
Exploiting Small-Norm Polynomial Multiplication with Physical Attacks
Transactions on Cryptographic Hardware and Embedded SystemsWe present a set of physical profiled attacks against CRYSTALS-Dilithium that accumulate noisy knowledge on secret keys over multiple signatures, finally leading to a full key recovery attack. The methodology is composed of two steps.
Olivier Bronchain +4 more
doaj +1 more source
Accelerating HQC with Additive FFT
Transactions on Cryptographic Hardware and Embedded SystemsThis paper presents an accelerated implementation of the Hamming Quasi-Cyclic (HQC) key encapsulation mechanism by leveraging additive Fast Fourier Transform (FFT) for polynomial multiplication (polymuls).
Ming-Shing Chen +3 more
doaj +1 more source
On multiplicative decompositions of polynomial sequences, II [PDF]
Acta Arithmetica, 2018 In this paper, the relations between the zeta functions of smooth projective varieties over finite fields and the functions of degree \(0\) from the extended Selberg class \(S^{\sharp}\) have been considered. Let \(S_{0}^{\sharp}\) denote the subclass of degree \(0\) functions in \(S^{\sharp}\).
Hajdu, Lajos, Sárközy, András
openaire +3 more sources
Cost-Efficient Pipelined Modular Polynomial Multiplier for Post-Quantum Cryptography Saber
Quantum ReportsThe development of quantum computers presents a great challenge for current cryptographic algorithms. Post-quantum cryptography has been proposed to secure against quantum computers in the near future.
Hua Li
doaj +1 more source