>>> 哲学 经济学 法学 教育学 文学 历史学 理学 工学 农学 医学 军事学 管理学 旅游学 文化学 特色库
搜索结果: 1-15 共查到finite field 2相关记录22条 . 查询时间(0.109 秒)
Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by sever...
In a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In ...
We describe a method to decompose any power permutation, as a sequence of power permutations of lower algebraic degree. As a result we obtain decompositions of the inversion in GF(2n)GF(2n) for small ...
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...
If qq is a prime and nn is a positive integer then any two finite fields of order qnqn are isomorphic. Elements of these fields can be thought of as polynomials with coefficients chosen modulo qq, and...
In quantum cryptography, a one-way permutation is a bounded unitary operator U:H↦HU:H↦H on a Hilbert space HH that is easy to compute on every input, but hard to invert given the image of ...
Isogeny based post-quantum cryptography is one of the most recent addition to the family of quantum resistant cryptosystems. In this paper, we propose an efficient modular multiplication algorithm for...
It is a long-standing open problem to prove the existence of (deterministic) hard-core predicates for the Computational Diffie-Hellman (CDH) problem over finite fields, without resorting to the gene...
A side-channel analysis of multiplication in GF(2^{128}) has recently been published by Bela飀, Fouque and G閞ard at Asiacrypt 2014, with an application to AES-GCM. Using the least significant bit of th...
In view of the problems that the plaintext space is too small in the existing schemes. In this paper, a new improved scheme is presented by improving the DGHV scheme. The plaintext space of the improv...
Efficient computation of $r$-th root in $\mathbb F_q$ has many applications in computational number theory and many other related areas. We present a new $r$-th root formula which generalizes M\"{u}ll...
In this paper, we present a new cube root algorithm in finite field $\mathbb{F}_{q}$ with $q$ a power of prime, which extends the Cipolla-Lehmer type algorithms \cite{Cip,Leh}. Our cube root method is...
We compute the mod $p$ cohomology algebra of a family of infinite discrete Kac-Moody groups of rank two defined over finite fields of characteristic different from $p$.
We show that the automorphism group of Drinfeld's half-space over a finite field is the projective linear group of the underlying vector space. The proof of this result uses analytic geometry in the s...
We compare a heuristic count of components of the center variety in degree 3 with the equivalent count obtained from known families.From this comparison we conjecture that more than 100 unknown compon...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...