>>> 哲学 经济学 法学 教育学 文学 历史学 理学 工学 农学 医学 军事学 管理学 旅游学 文化学 特色库
搜索结果: 1-15 共查到Polynomial相关记录358条 . 查询时间(0.168 秒)
The Grobner basis for a zero-dimensional polynomial ideal comprises a univariate polynomial in the least variable. The elimination process in Buchberger's algorithm unnecessarily involves the least va...
In this series of work, we aim at improving the bootstrapping paradigm for fully homomorphic encryption (FHE). Our main goal is to show that the amortized cost of bootstrapping within a polynomial mod...
We will introduce the polynomial partitioning method which has wide applications in incidence geometry, geometric measure theory, and harmonic analysis. In the first course, we will present some basic...
We will introduce the polynomial partitioning method which has wide applications in incidence geometry, geometric measure theory, and harmonic analysis. In the first course, we will present some basic...
Topological nodal line semimetals can host stable chained, linked, or knotted line degeneracies in momentum space protected by symmetries. In this talk, I will show how to use the Jones polynomial (wh...
We introduce novel efficient and transparent construction of the polynomial commitment scheme. A polynomial commitment scheme allows one side (the prover) to commit to a polynomial of predefined degre...
We present preprocessing-MPC schemes of arithmetic functions with optimal round complexity, function-independent correlated randomness, and communication and space complexities that grow linearly with...
We propose two polynomial memory collision finding algorithms for the low Hamming weight discrete logarithm problem in any abelian group GG. The first one is a direct adaptation of the Becker-Coron-Jo...
We give the first construction of statistical Zaps. Our construction satisfies computational soundness and relies on the quasi-polynomial hardness of learning with errors assumpteprint.iacr.orgion.
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can ...
Bootstrapping is a crucial but computationally expensive step for realizing Fully Homomorphic Encryption (FHE). Recently, Chen and Han (Eurocrypt 2018) introduced a family of low-degree polynomials to...
The contribution vector (convec) of a secret sharing scheme is the vector of all share sizes divided by the secret size. A measure on the convec (e.g., its maximum or average) is considered as a crite...
Nearly all secret sharing schemes studied so far are linear or multi-linear schemes. Although these schemes allow to implement any monotone access structure, the share complexity may be suboptimal -- ...
Every known construction of general indistinguishability obfuscation (iOiO) is either based on a family of exponentially many assumptions, or is based on a single assumption -- e.g.~functional encrypt...
In this paper, we present an optimized FPGA implementation of a novel, fast and highly parallelized NTT-based polynomial multiplier architecture, which proves to be effective as an accelerator for lat...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...