Sciweavers

ECCC
2000
93views more  ECCC 2000»
13 years 3 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
IJNSEC
2006
61views more  IJNSEC 2006»
13 years 3 months ago
Is There a Shortage of Primes for Cryptography?
Cryptographic algorithms often prescribe the use of primes whose length in bits is a power of 2. Recently, we proved that for m > 1, there is no prime number with 2m significan...
Samuel S. Wagstaff Jr.
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 5 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
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...
Jean-Charles Faugère, Raphaël Marinier...
CSSE
2008
IEEE
13 years 10 months ago
Embedding in Two Least Significant Bits with Wet Paper Coding
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...
Xin Liao, Qiao-Yan Wen