Lattice Reduction Aided MMSE Tomlinson-Harashima Precoding Based on VBLAST Algorithm for MIMO Systems

A lattice reduction aided (LRA) minimum mean square error (MMSE) Tomlinson-Harashima pre-coding (THP) was proposed based on vertical Bell Labs layered space time (VBLAST) algorithm for multiple input multiple output (MIMO) systems. The extended channel was used to provide optimal tradeoff between residual interference and noise amplification. The processing based on lattice reduction method helps achieve maximal diversity order. The VBLAST algorithm was applied to get the optimal processing ordering for successive interference cancellation (SIC) at transmitter. Simulation results show that the proposed algorithm outperforms conventional THP and the LRA zero-forcing (ZF) THP with full diversity order.

Ordered successive noise projection cancellation algorithm for dual lattice-reduction-aided MIMO detection

A novel nonlinear multi-input multi-output MIMO detection algorithm is proposed which is referred to as an ordered successive noise projection cancellation OSNPC algorithm. It is capable of improving the computation performance of the MIMO detector with the conventional ordered successive interference cancellation OSIC algorithm. In contrast to the OSIC in which the known interferences in the input signal vector are successively cancelled the OSNPC successively cancels the known noise projections from the decision statistic vector. Analysis indicates that the OSNPC is equivalent to the OSIC in error performance but it has significantly less complexity in computation.Furthermore when the OSNPC is applied to the MIMO detection with the preprocessing of dual lattice reduction DLR the computational complexity of the proposed OSNPC-based DLR-aided detector is further reduced due to the avoidance of the inverse of the reduced basis of the dual lattice in computation compared to that of the OSIC-based one. Simulation results validate the theoretical conclusions with regard to both the performance and complexity of the proposed MIMO detection scheme.

Lattice-reduction-aided MMSE precoding for correlated MIMO channels and performance analysis

The lattice-reduction （LR） has been developed to im- prove the performance of the zero-forcing （ZF） precoder in multiple input multiple output （MIMO） systems. Under the assumptions of uncorrelated flat fading channel model and perfect channel state information at the transmitter （CSIT）, an LR-aided ZF precoder is able to collect the full transmit diversity. With the complex Lenstra- Lenstra-Lov^sz （LLL） algorithm and limited feedforward structure, an LR-aided linear minimum-mean-square-error （LMMSE） pre- coder for spatial correlated MIMO channels and imperfect CSIT is proposed to achieve lower bit error rate （BER）. Assuming a time division duplexing （TDD） MIMO system, correlated block flat fad- ing channel and LMMSE uplink channel estimator, it is proved that the proposed LR-aided LMMSE precoder can also obtain the full transmit diversity through an analytical approach. Furthermore, the simulation results show that with the quadrature phase shift keying （QPSK） modulation at the transmitter, the uncoded and coded BERs of the LR-aided LMMSE precoder are lower than that of the traditional LMMSE precoder respectively when Eb-No is greater than 10 dB and 12 dB at all correlation coefficients.

A Fixed-Point Iterative Method for Discrete Tomography Reconstruction Based on Intelligent Optimization

Discrete Tomography(DT)is a technology that uses image projection to reconstruct images.Its reconstruction problem,especially the binary image(0–1matrix)has attracted strong attention.In this study,a fixed point iterative method of integer programming based on intelligent optimization is proposed to optimize the reconstructedmodel.The solution process can be divided into two procedures.First,the DT problem is reformulated into a polyhedron judgment problembased on lattice basis reduction.Second,the fixed-point iterativemethod of Dang and Ye is used to judge whether an integer point exists in the polyhedron of the previous program.All the programs involved in this study are written in MATLAB.The final experimental data show that this method is obviously better than the branch and bound method in terms of computational efficiency,especially in the case of high dimension.The branch and bound method requires more branch operations and takes a long time.It also needs to store a large number of leaf node boundaries and the corresponding consumptionmatrix,which occupies a largememory space.

Enhanced NTRU cryptosystem eliminating decryption failures

An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reductionalgorithms are analyzed to evaluate the security of this scheme. Furthermore, the new scheme remains the advantage of high efficiency of original NTRU.

A New Random Sampling Method and Its Application in Improving Progressive BKZ Algorithm

Random sampling algorithm was proposed firstly by Schnorr in 2003 to find short lattice vectors,as an alternative to enumeration.The follow-up developments in random sampling were mainly proposed by Fukase and Kashiwabara in 2015 and Aono and Nguyen in 2017.Although they extended the sampling space compared to Schnorr's work through the natural number representation,they did not show how to sample specifically in practice and what vectors should be sampled,in order to find short enough lattice vectors.In this paper,the authors firstly introduce a practical random sampling algorithm under some reasonable assumptions which can find short enough lattice vectors efficiently.Then,as an application of this new random sampling algorithm,the authors show that it can improve the performance of progressive BKZ algorithm in practice.Finally,the authors solve the Darmstadt's Lattice Challenge and get a series of new records in the dimension from 500 to 825,using the improved progressive BKZ algorithm.

On the Successive Minima of Subbases of Low-Dimensional Lattices

In this paper we discuss the global optimality of vector lengths for lattice bases. By introducing a partial order on lattice bases and the concept of successive minimal basis （SMB for short）, we show that any of its minimal elements is a general greedy-reduced basis, and its least element （if exists） is an SMB. Furthermore, we prove the existence of SMB for lattices of dimension up to 6.

Cryptanalysis of RSA for a special case with d>e

In this paper, we study the RSA public key cryptosystem in a special case with the private exponent d larger than the public exponent e. When N^0.258 ≤ e ≤N^0.854, d 〉 e and satisfies the given conditions, we can perform cryptanalytic attacks based on the LLL lattice basis reduction algorithm. The idea is an extension of Boneh and Durfee＇s researches on low private key RSA, and provides a new solution to finding weak keys in RSA cryptosystems.

Probability method for cryptanalysis of general multivariate modular linear equation

Finding the solution to a general multivariate modular linear equation plays an important role in cryptanalysis field. Earlier results show that obtaining a relatively short solution is possible in polynomial time. However, one problem arises here that if the equation has a short solution in given bounded range, the results outputted by earlier algorithms are often not the ones we are interested in. In this paper, we present a probability method based on lattice basis reduction to solve the problem. For a general multivariate modular linear equation with short solution in the given bounded range, the new method outputs this short solution in polynomial time, with a high probability. When the number of unknowns is not too large （smaller than 68）, the probability is approximating 1. Experimental results show that Knapsack systems and Lu-Lee type systems are easily broken in polynomial time with this new method.