Let N1 = p1q1 and N2 = p2q2 be two different RSA moduli. Suppose that p1 = p2 mod 2 t for some t, and q1 and q2 are α bit primes. Then May and Ritzenhofen showed that N1 and N2 can be factored in quadratic time if t ≥ 2α+ 3. In this paper, we improve this lower bound on t. Namely we prove that N1 and N2 can be factored in quadratic time if t ≥ 2α+ 1. Further our simulation result shows that our...

abstract time domain reflectometry (tdr) is a widely used method for measuring the dielectric constant (ka) and bulk electrical conductivity (σa) in soils. the tdr-measured σa and ka can be used to calculate the soil solution electrical conductivity, (σp). a theoretical model describing a linear relationship between bulk electrical conductivity, σa, and dielectric constant, ka, in moist soil wa...

a parallel algorithm for generating t-ary tree sequences in reverse b-order is presented. the algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time o(1). the algorithm is executed on a crew sm simd model, and is adaptive and cost-optimal. prior to the discussion of the parallel algorithm a new sequential generation with o(1) average time ...