>>> 哲学 经济学 法学 教育学 文学 历史学 理学 工学 农学 医学 军事学 管理学 旅游学 文化学
搜索结果: 1-15 共查到numbers相关记录304条 . 查询时间(0.078 秒)
In this talk, we investigate congruence properties for Motzkin numbers and central trinomial coefficients. Let M_n and T_n denote the nth Motzkin number and the nth central trinomial coefficient respe...
When it comes to toxic microbial warfare, the stronger microbe does not always win.
As their name suggests, by-the-wind sailor jellyfish know how to catch a breeze. Using a stiff, translucent sail propped an inch above the surface of the ocean, these teacup-sized organisms skim along...
We propose a new method to compare numbers which are encrypted by Homomorphic Encryption (HE). Previously, comparison and min/max functions were evaluated using Boolean functions where input numbers a...
In this paper, we recast state-of-the-art constructions for fully homomorphic encryption in the simple language of arithmetic modulo large Fermat numbers. The techniques used to construct our scheme a...
We consider the problem of constructing Diffie-Hellman (DH) parameters which pass standard approaches to parameter validation but for which the Discrete Logarithm Problem (DLP) is relatively easy to s...
云南师范大学商学院英语阅读课件 Numbers and Omens
A number of homomorphic encryption application areas, such as privacy-preserving machine learning analysis in the cloud, could be better enabled if there existed a general solution for combining suffi...
There’s a particular set of chemical reactions that governs many of the processes around us—everything from bridges corroding in water to your breakfast breaking down in your gut. One crucial part of ...
This workshop will consist of expository mini-courses and lectures introducing various aspects of modern enumerative geometry, among which: enumeration via intersection theory on moduli spaces of curv...
Fully Homomorphic Encryption (FHE) schemes are a powerful tool that allows arbitrary computations on encrypted data. This makes them a promising tool for a variety of use cases that require outsourcin...
In this work, we propose a new public-key cryptosystem whose security is based on the computational intractability of the following problem: Given a Mersenne number p = 2^n - 1, where n is a prime, a ...
For a composite integer NN that we would like to factor, we consider a condition for the elliptic curve method using NN as a scalar value to succeed and show that if NN has a prime factor pp such that...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...