No abstract uploaded!

Japan’s lunar probe satellite “Kaguya”, China’s lunar probe satellite “Chang’ e-1 lunar probe” left the earth on September 14th, 2007 and October 24th, 2007, began the exploration to the moon. The launching of the China’s lunar satellite is the proud to the global Chinese. However, at the same time as we are proud of the event, we must admit that the pictures published which were sent back by Japanese are clearer and more beautiful than Chinese. While we are saying that the Japan has a better technology, maybe we also need to say that the Japanese can hold better chance than Chinese when taking the pictures. The following two pictures were sent back by the satellite. Picture one is sent back by Japan’s satellite, Picture two is sent back by China’s. It can be seen that there is a long way for China if we want to become stronger at science technology. We also hope that we can have some contribution in the prosperity of China now and in the future.

No abstract uploaded!

We prove that there is a unique way to construct a geometric scale of Hilbert spaces interpolating between two given spaces. We investigate what properties of operators, other than boundedness, are preserved by interpolation. We show that self-adjointness is, but subnormality and Krein subnormality are not. On the way to this last result, we establish a representation theorem for cyclic Krein subnormal operators.

Error reconciliation is an important technique for learning with error (LWE) and ring-LWE (RLWE)-based constructions. In this paper, we present a comparison analysis on two error reconciliation-based RLWE key exchange protocols: Ding et al. in 2012 (DING12) and Bos et al. in 2015 (BCNS15). We take them as examples to explain the core idea of error reconciliation, building key exchange over RLWE problem, implementation and real-world performance, and compare them comprehensively. We also analyse a LWE key exchange 'Frodo' that uses an improved error reconciliation mechanism in BCNS15. To the best of our knowledge, our work is the first to present at least 128-bit classic (80-bit quantum) and 256-bit classic (> 200-bit quantum) secure parameter choices for DING12 with efficient portable C/C++ implementations. Benchmark shows that our efficient implementation is 11× faster than BCNS15 and one key exchange execution only costs 0.07 ms on a four-year-old middle range CPU. Error reconciliation is 1.57× faster than BCNS15.