22 search results - page 1 / 5 » On Factoring Arbitrary Integers with Known Bits |
GI
2007
Springer
14 years 5 months ago
2007
Springer
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
IEICET
2008
13 years 11 months ago
2008
Abstract. In this paper we propose an algorithm of factoring any integer N which has k different prime factors with the same bit-length, when ( 1 k+2 + k(k-1) ) log N high-order bi...
ASIACRYPT
2008
Springer
14 years 1 months ago
2008
Springer
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
ICICS
2004
Springer
14 years 4 months ago
2004
Springer
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...