搜索结果: 61-75 共查到“军事学 RSA”相关记录163条 . 查询时间(0.059 秒)
A Unified Framework for Small Secret Exponent Attack on RSA
public-key cryptography / lattice techniques RSA cryptanalysis
2012/3/22
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...
A Unified Framework for Small Secret Exponent Attack on RSA
public-key cryptography / lattice techniques RSA cryptanalysis
2012/3/21
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...
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
public-key cryptography / RSA OAEP padding-based encryption lossy trapdoor functions leftover hash lemma standard model
2012/3/23
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash ({\em i.e.}, round) ...
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
public-key cryptography / RSA OAEP padding-based encryption lossy trapdoor functions leftover hash lemma standard model
2012/3/23
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash ({\em i.e.}, round) ...
An Improved Trace Driven Instruction Cache Timing Attack on RSA
public-key cryptography / Instruction cache-timing attacks side channel attack RSA cryptographic algorithm Trace-driven.
2012/3/23
The previous I-cache timing attacks on RSA which exploit the instruction path of a cipher were mostly proof-of-concept, and it is harder to put them into practice than D-cache timing attacks. We propo...
It is well-known that, due to the homomorphic properties of the RSA function, textbook RSA signatures are insecure, and a common workaround is to encode messages with a so-called padding function mu b...
Modulus Fault Attacks Against RSA-CRT Signatures
implementation / Fault Attacks Digital Signatures RSA CRT Lattices
2012/3/27
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997. We present alternative key-recovery attacks on RSA-CRT signatures: instead of target...
Modulus Fault Attacks Against RSA-CRT Signatures
Fault Attacks Digital Signatures RSA CRT Lattices
2011/7/25
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997.
On the (In)Security of RSA Signatures
RSA Signature Full Domain Hash Random Oracle Heuristic Generic Groups Black-Box Reductions
2011/3/10
Bellare and Rogaway [ACM CCS ’93] introduced the famous random oracle model as a
“paradigm for designing efficient protocols”. This paradigm has led to several highly efficient
and widely used in pr...
On small secret key attack against RSA with high bits known prime factor
RSA high bits known small secret key attack LLL reduction
2011/1/5
It is well known that if the higher half bits of a prime factor are known or the secret key is small enough then the RSA cryptosystem is broken (e.g. [Coppersmith, J. Cryptology, 1997] and [Boneh-Durf...
Cryptanalysis of the RSA Subgroup Assumption from TCC 2005
rsa moduli hidden order subgroup cryptanalysis
2010/12/22
At TCC 2005, Groth underlined the usefulness of working in small RSA subgroups of hidden order. In assessing the security of the relevant hard problems, however, the best attack considered for a subgr...
Several schemes under the framework of Dual RSA have been proposed by Sun et al (IEEE-IT, August 2007). We here concentrate on the Dual CRT-RSA scheme and present certain range of parameters for which...
A Suite of Identity Based Aggregate Signatures and a Multi-Signature Scheme from RSA
Identity Based Dererministic Signature Aggregate Signature Full Aggregation Random Oracle Model Provable Security
2010/9/26
Fully aggregateable identity based signature schemes without prior communication between the signing parties is an interesting issue in identity based cryptography. On this front, we identify that det...
CCA2 Secure Certificateless Encryption Schemes Based on RSA
Certificateless encryption Adaptive Chosen Ciphertext Secure (CCA2) RSA Assumption Random Oracle model
2010/9/1
Certificateless cryptography, introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystem. In this paper, we present two novel and completely differe...
Factorization of RSA-180
RSA factoring
2010/7/13
We present a brief report on the factorization of RSA-180, currently smallest unfactored RSA number. We show that the numbers of similar size could be factored in a reasonable time at home using open ...