搜索结果: 106-120 共查到“军事学 RSA”相关记录163条 . 查询时间(0.14 秒)
网络环境中基于RSA算法的密钥托管
密钥托管 RSA算法 网络环境
2009/5/11
密钥托管密码体制不仅能保护用户的隐私权,同时允许法律授权下的监听。本文提出了在网络环境中基于RSA算法的一种密钥托管体制。系统中有一可信中心,为每一用户指定n个委托人,每一委托人为网络中一服务器。可信中心按(t,n)门限方案为n个委托人分配恢复用户密钥的部分能力。用户在系统中广播自己经过加密的密钥时,仅当至少有t个委托人联合起来才能实施对用户的监听。
可公开验证的ElGamal／RSA加密
可公开验证加密 零知识证明 bit承诺
2009/4/27
可公开验证加密允许任何实体验证加密的消息和先前承诺的秘密一样，但不会泄漏明文的任何信息。这在公平交换、防欺骗的秘密分享和安全多方计算中有重要应用。该文分别给出可公开验证的ElGamal加密和RSA加密方案。其中前者是Stalderr方案的改进，改进后的方案是语义安全的而Stalder方案达不到语义安全性。同时将该方案推广到了多个接受者的情形，最后给出了高效的可公开验证RSA加密方案。
私钥p,q共享低位比特RSA体制的小指数攻击
RSA密码系统 格攻击 共享低位比特
2009/4/22
本文研究了组成RSA模数的两个素数p和q其低位比特相同,RSA公开密钥密码系统的安全性。其结果表明若RSA模数的两个素因子p和q共享低位比特,则当私钥d较小时这样的体制相对于模数不平衡的RSA更易受到攻击。本文的研究结果表明,当组成RSA模数的两个素数p和q仅有少量比特不相同时,使用规模较小的私钥d必须十分慎重。
Recently Victor Shoup noted that there is a gap in the widely-believed security
result of OAEP against adaptive chosen-ciphertext attacks. Moreover,
he showed that, presumably, OAEP cannot be proven...
The Security of Practical Two-Party RSA Signature Schemes
RSA digital signatures two-party protocols proofs of security
2009/4/16
In a two-party RSA signature scheme, a client and server, each holding a share of an RSA
decryption exponent d, collaborate to compute an RSA signature under the corresponding public
key N; e known ...
Fully Distributed Threshold RSA under Standard Assumptions
Fully Distributed Threshold RSA Standard Assumptions
2009/4/16
Fully Distributed Threshold RSA under Standard Assumptions.
The One-More-RSA-Inversion Problems and the Security of Chaum’s Blind Signature Scheme
RSA blind signatures
2009/4/16
We introduce a new class of computational problems which we call the “one-more-RSAinversion”
problems. Our main result is that two problems in this class, which we call the
chosen-target and known-t...
We present extremely simple ways of embedding a backdoor
in the key generation scheme of RSA. Three of our schemes generate
two genuinely random primes p and q of a given size, to obtain their
publ...
A semantically secure elliptic curve RSA scheme with small expansion factor
public-key cryptography semantic security expansion factor
2009/4/14
We propose an elliptic curve scheme over the ring Zn2 , which is efficient
and semantically secure in the standard model, and it has expansion
factor 2 (previous schemes with similar features presen...
Fault attacks on RSA with CRT:Concrete Results and Practical Countermeasures
Fault attacks Bellcore attack Hardware security
2009/4/14
This article describes concrete results and practically approved countermeasures
concerning di erential fault attacks on RSA using the CRT. It especially investigates smartcards
with a RSA coprocess...
Further Results and Considerations on Side Channel Attacks on RSA
confirmation oracle RSA-KEM RSAES-OAEP
2009/4/14
This paper contains three parts. In the first part we present a new side channel
attack on plaintext encrypted by EME-OAEP PKCS#1 v.2.1. In contrast with Manger´s
attack, we attack that part o...
The Cramer-Shoup Strong-RSA Signature Scheme Revisited
Cramer-Shoup Strong-RSA Signature Scheme
2009/4/13
We discuss a modification of the Cramer-Shoup strong-RSA
signature scheme. Our proposal also presumes the strong RSA assumption
(and a collision-intractable hash function for long messages), but
|w...
We describe an efficient combination of two variants of RSA
cryptosystem (MPrime and Rebalanced RSA) analysed by Boneh and
Schacham [2]. The decryption process resultant is (for 2048-bits moduli)
a...
In this paper we present a practically feasible attack on RSA-based
sessions in SSL/TLS protocols. These protocols incorporate the PKCS#1 (v.
1.5) encoding method for the RSA encryption of a premast...
An algorithm to obtain an RSA modulus with a large private key
algorithm RSA modulus private key
2009/4/8
An algorithm to obtain an RSA modulus with a large private key.