Sciweavers

ASIACRYPT
2008
Springer
14 years 1 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
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 ...
Mathias Herrmann, Alexander May
ASIACRYPT
2004
Springer
14 years 3 months ago
Time-Memory Trade-Off Attacks on Multiplications and T-Functions
T
Joydip Mitra, Palash Sarkar