>>> 哲学 经济学 法学 教育学 文学 历史学 理学 工学 农学 医学 军事学 管理学 旅游学 文化学 特色库
搜索结果: 1-15 共查到m exponent相关记录53条 . 查询时间(0.088 秒)
Boolean Exponent Splitting     exponent splitting  masking  side-channel attacks  countermeasures       font style='font-size:12px;'> 2019/1/2
A typical countermeasure against side-channel attacks consists of masking intermediate values with a random number. In symmetric cryptographic algorithms, Boolean shares of the secret are typically us...
The hardness of decoding random linear codes with errors is a complexity-theoretic assumption with broad applications to cryptography. In contrast, Reed-Solomon codes permit efficient decoding in many...
This study analyzed the spatial and temporal variations in the Normalized Difference Vegetation Index (NDVI) on the Mongolian Plateau from 1982-2013 using Global Inventory Modeling and Mapping Studies...
We present a principled technique for reducing the matrix size in some applications of Coppersmith's lattice method for finding roots of modular polynomial equations. It relies on an analysis of the a...
Small CRT-Exponent RSA Revisited     CRT-RSA  cryptanalysis  Coppersmith's method  lattices       font style='font-size:12px;'> 2017/2/20
Since May (Crypto'02) revealed the vulnerability of the small CRT-exponent RSA using Coppersmith's lattice-based method, several papers have studied the problem and two major improvements have been ma...
Rowhammer attacks have exposed a serious vulnerability in modern DRAM chips to induce bit flips in data which is stored in memory. In this paper, we develop a methodology to combine timing analysis to...
A new attack on RSA with a composed decryption exponent     RSA  Cryptanalysis  Factorization       font style='font-size:12px;'> 2016/1/26
In this paper, we consider an RSA modulus N = pq, where the prime factors p, q are of the same size. We present an attack on RSA when the decryption exponent d is in the form d = M d1 + d0 where M ...
Boneh-Boyen signatures are widely used in many advanced cryptosystems. It has a structure of “inversion in the exponent”, and its unforgeability against q chosen-messages attack is proven under the ...
Learning with Errors in the Exponent     Lattice theory  group theory  public-key encryption       font style='font-size:12px;'> 2016/1/6
We initiate the study of a novel class of group-theoretic intractability problems. Inspired by the theory of learning in presence of errors [Regev, STOC'05] we ask if noise in the exponent amplifies i...
The references [9, 3, 1] treat timing attacks on RSA with CRT and Montgomery’s multiplication algorithm in unprotected implementations. It has been widely believed that exponent blinding would prev...
Simulation results are reported for the critical point of the two-component ϕ4 field theory. The correlation-length exponent is measured to high precision with the result ν=0.6717(3). This value ...
In this paper, we study the global existence and nonexistence of positive solutions to the following nonlinear reaction-di usion system 8>>>>>>>>>>>>< >>>>>>>>>>>>: ut 􀀀 u = W(x)vp + S(x...
In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. In particular, we study the $B_n$-LHN problem, which is a generalized version of th...
We address a lattice based method on small secret exponent attack on RSA scheme. Boneh and Durfee reduced the attack into finding small roots of a bivariate modular equation: $x(N+1+y)+1 ¥equiv 0 mod ...
We address a lattice based method on small secret exponent attack on RSA scheme. Boneh and Durfee reduced the attack into finding small roots of a bivariate modular equation: $x(N+1+y)+1 quiv 0 mod e...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...