In 1998, Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman introduced the famous NTRU cryptosystem, and called it "A ring-based public key cryptosystem". Actually, it turns out to be a lattice based cryptosystem that is resistant to Shor's algorithm. There are several modifications to the original NTRU and two of them are selected as round 2 candidates of NIST post quantum public key scheme standardization. In this paper, we present a simple attack on the original NTRU scheme. The idea comes from Ding et al.'s key mismatch attack. Essentially, an adversary can find information on the private key of a KEM by not encrypting a message as intended but in a manner which will cause a failure in decryption if the private key is in a certain form. In the present, NTRU has the encrypter generating a random polynomial with "small" coefficients, but we will have the coefficients be "large". After this, some further work will create an equivalent key.

No abstract uploaded!

In this paper, we extend the one-parametric class of merit functions proposed by Kanzow and Kleinmichel [C. Kanzow, H. Kleinmichel, A new class of semismooth Newton-type methods for nonlinear complementarity problems, Comput. Optim. Appl. 11 (1998) 227251] for the nonnegative orthant complementarity problem to the general symmetric cone complementarity problem (SCCP). We show that the class of merit functions is continuously differentiable everywhere and has a globally Lipschitz continuous gradient mapping. From this, we particularly obtain the smoothness of the FischerBurmeister merit function associated with symmetric cones and the Lipschitz continuity of its gradient. In addition, we also consider a regularized formulation for the class of merit functions which is actually an extension of one of the NCP function classes studied by [C. Kanzow, Y. Yamashita, M. Fukushima, New NCP functions and

Recent proposals for implementation of kernel-based nonparametric curve estimators are seen to be faster than naive direct implementations by factors up into the hundreds. The main ideas behind the two different approaches are made clear. Careful speed comparisons in a variety of settings and using a variety of machines and software are done. Various issues on computational accuracy and stability are also discussed. Our speed tests show that the fast methods are as fast or somewhat faster than methods traditionally considered very fast, such as LOWESS and smoothing splines.

We propose definitions of quasilocal energy and momentum surface energy of a spacelike 2-surface with positive intrinsic curvature in a spacetime. Our definitions do not depend on the compact spacelike hypersurface it bounds. We show that the quasilocal energy of the boundary of a compact spacelike hypersurface which satisfies the local energy condition is strictly positive unless the spacetime is flat along the spacelike hypersurface.