搜索结果: 1-13 共查到“密码学 Chinese Remainder Theorem”相关记录13条 . 查询时间(0.06 秒)
Constructing Ideal Secret Sharing Schemes based on Chinese Remainder Theorem
Threshold Secret Sharing Chinese Remainder Theorem Polynomial Ring
2018/11/16
Since (t,n)(t,n)-threshold secret sharing (SS) was initially proposed by Shamir and Blakley separately in 1979, it has been widely used in many aspects. Later on, Asmuth and Bloom presented a (t,n)(t,...
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
Discrete logarithm Hensel lift Multivaraible Chinese Remainder theorem
2016/12/10
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem.
A Chinese Remainder Theorem Approach to Bit-Parallel GF(2^n) Polynomial Basis Multipliers for Irreducible Trinomials
implementation Irreducible Trinomials
2016/1/5
We show that the step “modulo the degree-n field generating irreducible polynomial” in the classical definition of the GF(2^n) multiplication operation can be avoided. This leads to an alternative rep...
Yet Another Attack On the Chinese Remainder Theorem Based Hierarchical Access Control Scheme
communication security CRTHACS Chinese remainder theorem hierarchical access control secure group communication
2013/4/18
The hierarchical access control scheme based on Chinese Reminder Theorem [49] (CRTHACS) was supposed to be capable of hiding hierarchical structure, but Geiselmann et al. [18] showed practical attacks...
An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem (Revised Version)
rational cryptography computational strict Nash equilib-rium
2011/7/25
The design of rational cryptographic protocols is a recently created research area at the intersection of cryptography and game theory. At TCC'10, Fuchsbauer \emph{et al.} introduced two equilibrium n...
An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem (Revised Version)
cryptographic protocols / rational cryptography computational strict Nash equilibrium stability with respect to trembles Asmuth-Bloom sharing
2012/3/27
The design of rational cryptographic protocols is a recently created research area at the intersection of cryptography and game theory. At TCC'10, Fuchsbauer \emph{et al.} introduced two equilibrium n...
Secret Sharing Extensions based on the Chinese Remainder Theorem
Verifiability joint random secret sharing proactive secretsharing Chinese Remainder Theorem Asmuth-Bloom
2010/3/16
In this paper, we investigate how to achieve verifiable secret
sharing (VSS) schemes by using the Chinese Remainder Theorem (CRT).
We first show that two schemes proposed earlier are not secure from...
COMPUTING HILBERT CLASS POLYNOMIALS WITH THE CHINESE REMAINDER THEOREM
space-efficient algorithm CM method elliptic curves
2009/9/27
We present a space-efficient algorithm to compute the Hilbert class
polynomial HD(X) modulo a positive integer P, based on an explicit form of
the Chinese Remainder Theorem. Under the Generalized Ri...
COMPUTING HILBERT CLASS POLYNOMIALS WITH THE CHINESE REMAINDER THEOREM
Computing Hilbert class polynomials Chinese Remainder Theorem
2009/9/22
We present a space-ecient algorithm to compute the Hilbert class
polynomial HD(X) modulo a positive integer P, based on an explicit form of
the Chinese Remainder Theorem. Under the Generalized Riem...
Compartmented Threshold RSA Based on the Chinese Remainder Theorem
threshold cryptography secret sharing Chinese remainder theorem
2009/6/8
In this paper we combine the compartmented secret
sharing schemes based on the Chinese remainder theorem
with the RSA scheme in order to obtain, as a novelty, a
dedicated solution for compartmented...
Compartmented Secret Sharing Based on the Chinese Remainder Theorem
secret sharing compartmented access structure Chinese remainder theorem
2009/3/16
A secret sharing scheme starts with a secret and then derives from it certain shares
(or shadows) which are distributed to users. The secret may be recovered only by
certain predetermined groups. In...
General Secret Sharing Based on the Chinese Remainder Theorem
secret sharing general access structure Chinese remainder theorem
2008/11/20
In this paper we extend the threshold secret sharing schemes based on
the Chinese remainder theorem in order to deal with more general access structures.
Aspects like verifiability, secret sharing h...
Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem
knapsack public-key cryptosystem subset sum problem low-density attack
2008/9/8
he realization of the quantum computer will enable to break publickey
cryptosystems based on factoring problem and discrete logarithm problem. It
is considered that even the quantum computer can not...