Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,430,706 papers from all fields of science
Search
Sign In
Create Free Account
Kronecker substitution
Kronecker substitution is a technique named after Leopold Kronecker for determining the coefficients of an unknown polynomial by evaluating it at a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Multiplication algorithm
Polynomial
Power of two
Reduction (complexity)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Learning with Errors on RSA Co-Processors
Martin R. Albrecht
,
Christian H. Hanser
,
Andrea Höller
,
T. Pöppelmann
,
Fernando Virdia
,
Andreas Wallner
IACR Cryptology ePrint Archive
2018
Corpus ID: 44150556
We repurpose existing RSA/ECC co-processors for (ideal) lattice-based cryptography by exploiting the availability of fast long…
Expand
2017
2017
Revisit Randomized Kronecker Substitution based Sparse Polynomial Interpolation
Qiao-Long Huang
,
X. Gao
arXiv.org
2017
Corpus ID: 125098634
In this paper, a new Monte Carlo interpolation algorithm for sparse multivariate polynomials is given based on the idea of…
Expand
2017
2017
Sparse Interpolation of Black-box Multivariate Polynomials using Kronecker Type Substitutions
Qiao-Long Huang
,
Xiao-Shan Gao
arXiv.org
2017
Corpus ID: 263784517
In this paper, we give two new deterministic interpolation algorithms for black-box multivariate polynomials. For a t-sparse and…
Expand
2017
2017
Deterministic Interpolation of Sparse Black-box Multivariate Polynomials using Kronecker Type Substitutions.
Qiao-Long Huang
,
X. Gao
2017
Corpus ID: 51942765
In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard…
Expand
2017
2017
18.783 s19 Elliptic Curves, Lecture 4: Finite Field Arithmetic
Andrew Sutherland
2017
Corpus ID: 174786506
We saw in Lecture 3 how to eÿciently multiply integers, and, using Kronecker substitution, how to eÿciently multiply polynomials…
Expand
2015
2015
4 Arithmetic in finite fields II
Andrew V. Sutherland
2015
Corpus ID: 17995896
We saw in Lecture 3 how to efficiently multiply integers, and, using Kronecker substitution, how to efficiently multiply…
Expand
2010
2010
Multiplication of sparse Laurent polynomials and Poisson series on modern hardware architectures
F. Biscani
arXiv.org
2010
Corpus ID: 18178619
In this paper we present two algorithms for the multiplication of sparse Laurent polynomials and Poisson series (the latter being…
Expand