15 search results - page 1 / 3 » On the Security of RSA with Primes Sharing Least-Significant... |
AAECC
2004
Springer
13 years 4 months ago
2004
Springer
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
CSSE
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we present three embedding schemes for extensions of least significant bit overwriting to both of the two lowest bit planes in digital images. Our approaches are in...
PKC
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
IJNSEC
2008
13 years 4 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
NDSS
1999
IEEE
13 years 8 months ago
1999
IEEE
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...