Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

We repurpose existing RSA/ECC co-processors for (ideal) lattice-based cryptography by exploiting the availability of fast long… Expand

Is this relevant?

2017

2017

In this paper, we give two new deterministic interpolation algorithms for black-box multivariate polynomials. For a t-sparse and… Expand

Is this relevant?

2017

2017

In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given… Expand

Is this relevant?

2017

2017

In this paper, a new Monte Carlo interpolation algorithm for sparse multivariate polynomials is given based on the idea of… Expand

Is this relevant?

2015

2015

This paper revisits the problem of checking the robust stability of matrix families generated by interval parameters in a matrix… Expand

Is this relevant?

2014

2014

We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly… Expand

Is this relevant?

2012

2012

Firstly, two new kinds of Kronecker decompositions is developed, i.e. KPGD and KPID; Secondly, the sufficient and necessary… Expand

Is this relevant?

2011

2011

We present algorithms to perform modular polynomial multiplication or a modular dot product efficiently in a single machine word… Expand

Is this relevant?

2009

2009

We present several new algorithms for dense polynomial multiplication in Z[x] based on the Kronecker substitution method. Instead… Expand

Is this relevant?

Review

1994

Review

1994

Abstract Matrix pencils depending on a parameter and their canonical forms under equivalence are discussed. The study of matrix… Expand

Is this relevant?