Let G be a finite cyclic group with generator Î± and with an encoding so that multiplication is computable in polynomial time. We study the security of bits of the discrete log x when given expÎ±(x),â€¦ (More)

We present an algorithm which will factor an integer n quite efficiently if the class number h(-n) is free of large prime divisors. The running time T(n) (number of compositions in the class group)â€¦ (More)

Let b 1 : : : b m 2 IR n be an arbitrary basis of lattice L that is a block Korkin{Zolotarev basis with block s i z e and let i (L) denote the successive minima of lattice L. and we present b l o c kâ€¦ (More)

28th Annual Symposium on Foundations of Computerâ€¦

1987

Let the multiplicative complexity L(f) of a boolean function f be the minimal number of âˆ§-gates that are sufficient to evaluate f by circuits over the basis âˆ§,âŠ•,1. We give a polynomial time algorithmâ€¦ (More)

We introduce a novel method for ultrasound plane wave imaging that combines the plane wave decomposition of the incident pulse with the exact solution for the scattered field from small sphericalâ€¦ (More)