搜索结果: 1-15 共查到“MOD”相关记录38条 . 查询时间(0.046 秒)
The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
Lattice cryptography Ring-LWE Error Correcting Codes
2018/12/3
Current estimation techniques for the probability of decryption failures in Ring/Mod-LWE/LWR based schemes assume independence of the failures in individual bits of the transmitted message to calculat...
Most multi-party computation protocols allow secure computation of arithmetic circuits over a finite field, such as the integers modulo a prime. In the more natural setting of integer computations mod...
Computing Mod Without Mod
mod modulo modulus
2016/1/7
Encryption algorithms are designed to be difficult to break
without knowledge of the secrets or keys. To achieve this, the algorithms
require the keys to be large, with some algorithms having a reco...
Statistical Properties of Multiplication mod $2^n$
Modular multiplication Boolean function Joint probability distribution
2016/1/3
In this paper, we investigate some statistical properties of multiplication
mod 2n for cryptographic use. For this purpose, we introduce a family
of T-functions similar to modular multiplication, wh...
ON THE SURJECTIVITY OF MOD REPRESENTATIONS ASSOCIATED TO ELLIPTIC CURVES
MOD REPRESENTATIONS ASSOCIATED ELLIPTIC CURVES
2015/8/26
Let E be an elliptic curve over the rationals that does not have complex multiplication. For each prime `, the action of the absolute Galois group on the `-torsion points of E can be given in terms of...
THE DISTRIBUTION OF LEADING DIGITS AND UNIFORM DISTRIBUTION MOD
Arithmetic sequence theory triangular array coefficient of letters
2015/7/15
The lead digit behavior of a large class of arithmetic sequences is de-
termined by using results from the theory of uniform distribution mod I.
Theory for triangular arrays is developed and appli...
Let l=3 or 5. For any integer n>1, we produce an infinite set of triples
(L, E1, E2), where L is a number field with degree l
3(n&1) over Q and E1 and E2
are elliptic curves over L with distinct j-...
Influence of microphysical schemes on atmospheric water in the Weather Research and Forecasting mod
microphysical schemes atmospheric water
2014/12/18
This study examines how different microphysical
parameterization schemes influence orographically induced
precipitation and the distributions of hydrometeors and water vapour for midlatitude s...
How to Factor N_1 and N_2 When p_1=p_2 mod 2^t
factoring Gaussian reduction algorithm lattice
2014/3/13
Let $N_1=p_1q_1$ and $N_2=p_2q_2$ be two different RSA moduli. Suppose that $p_1=p_2 \bmod 2^t$ for some $t$, and $q_1$ and $q_2$ are $\alpha$ bit primes. Then May and Ritzenhofen showed that $N_1$ an...
On r-th Root Extraction Algorithm in F_q For q=lr^s+1 (mod r^(s+1)) with 0 < l < r and Small s
r-th root algorithm finite field Adleman-Manders-Miller algorithm Cipolla-Lehmer algorithm
2013/4/18
We present an r-th root extraction algorithm over a finite field F_q. Our algorithm precomputes a primitive r^s-th root of unity where s is the largest positive integer satisfying r^s| q-1, and is app...
We present a square root algorithm in F_q which generalizes Atkins's square root algorithm for q=5(mod 8) and Kong et al.'s algorithm for q=9(mod 16) Our algorithm precomputes a primitive 2^s-th root ...
中法时装业合作签字仪式--巴黎MOD’SPE携手上海国际时尚教育中心进军中国（图）
中法 时装业 合作 签字仪式 巴黎MOD’SPE 携手 上海国际时尚教育中心 进军 中国
2012/12/12
2012年3月30日中午，梅赛德斯-奔驰中国国际时装周•2012/2013秋冬系列期间，中国服装设计师协会与法国女装成衣协会FédérationFrançaiseduPrêtàPorterFéminin在北京饭店联合主办新闻发布会暨中法时装业和时尚教育业合作签字仪式，中国服装设计师协会主席李当岐先生与法国女装成衣协会主席Jean-PierreMOCHO先生宣布中法时装业将...
Mod-CSA: Modularity optimization by conformational space annealing
Mod-CSA Modularity optimization conformational space annealing
2012/2/29
We propose a new modularity optimization method, Mod-CSA, based on stochastic global optimization algorithm, conformational space annealing (CSA). Our method outperforms simulated annealing in terms o...
Randomized Secure Two-Party Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
applications / secure two-party computation randomized algorithm efficiency
2012/3/23
When secure arithmetic is required, computation based on secure multiplication ($\MULT$) is much more efficient than computation based on secure boolean circuits. However, a typical application can al...
Mod-$φ$ convergence
Local limit theorem convergence to stable laws mod-gaussian convergence plane Brownian motion
2011/9/22
Abstract: Using Fourier analysis, we study local limit theorems in weak-convergence problems. Among many applications, we discuss random matrix theory, some probabilistic models in number theory, the ...