Dysplay-Special Contribution from IWD'02-A 16-cm Dual Neck Diameter, Integrated Component, Projection CRT

Cryptanalysis of Dual CRT-RSA

Several schemes under the framework of Dual RSA have been proposed by Sun et al (IEEE-IT, August 2007). We here concentrate on the Dual CRT-RSA scheme and present certain range of parameters for which this is insecure. As a corollary of our work, we prove that the Dual Generalized Rebalanced-RSA (Scheme III of Sun et al) can be efficiently broken for a significant region where the scheme has be...

Minimum Dual Diameter Triangulations∗

Let P be a simple planar polygon with n vertices. We would like to find a triangulation MDT(P) of P that minimizes the diameter of the dual tree. We show that MDT(P) can be constructed in O(n log n) time. If P is convex, we show that the dual of any MDT has diameter 2 · dlog2(n/3)e or 2 · dlog2(n/3)e−1, depending on the value of n. We also investigate the relation between MDT(P) and the number ...

Special Contribution

Principal Component Projection Without Principal Component Analysis

We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoiding explicit principal component analysis (PCA), our algorithm is the first with no runtime dependen...

The Giant Component and Diameter

Let me recall what we proved about the Galton-Watson process, and one thing that I forgot to mention. In particular, I will be concerned with the case in which a cell splits into k children, each of which survives to split themselves with probability p = c/k. Theorem 5.2.1. Let Z be one plus the number of descendants of the first organism that survive to reproduce (not counting the first organi...