This paper proposes an improved lattice-reduction aided (IRA) MMSE detection based on the Gram-Schmidt (GS) procedure. The proposed detection reduces the column vectors of the MIMO channel matrix using the lll algorit...
详细信息
ISBN:
(纸本)9781424441471
This paper proposes an improved lattice-reduction aided (IRA) MMSE detection based on the Gram-Schmidt (GS) procedure. The proposed detection reduces the column vectors of the MIMO channel matrix using the lll algorithm and the GS procedure to create mutually purely orthogonal column vectors of the reduced channel matrix. Then the decision boundary becomes the same as that for the ML detection. Compared to the conventional LRA MMSE detector, the proposed detector achieves much closer BER performances to those for the ML detector in both the 4x4 MIMO and the 8x8 MIMO systems.
Lenstra-Lenstra-Lovasz (lll) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better basis of the channel matrix. In this paper, we jointly apply Seysen's latti...
详细信息
ISBN:
(纸本)9781424451234
Lenstra-Lenstra-Lovasz (lll) algorithm, which is one of the lattice reduction (LR) techniques, has been extensively used to obtain better basis of the channel matrix. In this paper, we jointly apply Seysen's lattice reduction algorithm (SA), instead of lll, with the conventional linear precoding algorithms. Since SA obtains more orthogonal lattice basis compared to that obtained by lll, lattice reduction aided (LRA) precoding based on SA algorithm outperforms the LRA precoding with lll. Simulation results demonstrate that a gain of 0.5dB at target BER of 10(-5) is achieved when SA is used instead of lll for the LR stage.
The study of paper "Cryptanalysis of RSA with Private Key d less than N-0.292, [IEEE Trans. Information Theory, 46 (2000) 1339], which Boneh and Durfee published in IEEE Transactions on Information Theory in July...
详细信息
The study of paper "Cryptanalysis of RSA with Private Key d less than N-0.292, [IEEE Trans. Information Theory, 46 (2000) 1339], which Boneh and Durfee published in IEEE Transactions on Information Theory in July 2000, supported that when d < N-0.292, the RSA system can be cracked by using the lll algorithm. In this paper, we find ways to utilize the lll algorithm to break the RSA system even when the value of d is large. According to the proposed cryptanalysis, if d satisfies vertical bar lambda - d vertical bar < N-0.25, the RSA system will be possible to be resolved computationally. (c) 2004 Elsevier Inc. All rights reserved.
For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA...
详细信息
For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA, where N = p(r)q while ed = 1 mod (p - 1)(q-1). In this paper, we show that a deterministic polynomial time equivalence also holds in this variant. The coefficient matrix T to which lll algorithm is applied is no longer lower triangular, and hence we develop a new technique to overcome this problem.
We study the hardness of the optimal jug measuring problem. By proving tight lower and upper bounds on the minimum number of measuring steps required, we reduce an inapproximable NP-hard problem (i.e., the shortest GC...
详细信息
We study the hardness of the optimal jug measuring problem. By proving tight lower and upper bounds on the minimum number of measuring steps required, we reduce an inapproximable NP-hard problem (i.e., the shortest GCD multiplier problem [G. Havas, J.-P. Seifert, The Complexity of the Extended GCD Problem, in: LNCS, vol. 1672, Springer, 1999]) to it. It follows that the optimal jug measuring problem is NP-hard and so is the problem of approximating the minimum number of measuring steps within a constant factor. Along the way, we give a polynomial-time approximation algorithm with an exponential error based on the well-known lll basis reduction algorithm. (C) 2008 Elsevier B.V. All rights reserved.
Consider RSA with N = pq, q 0 is arbitrarily small for suitably large N.
ISBN:
(纸本)9783540897538
Consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. We concentrate on the cases when e(= N-alpha) satisfies eX-ZY = 1, given vertical bar N-Z vertical bar = N-tau. Using the idea of Boneh and Durfee (Eurocrypt 1999, IEEE-IT 2000) we show that the lll algorithm can be efficiently applied to get Z when vertical bar Y vertical bar = N-gamma and gamma < 4 alpha tau (1/4 tau + 1/12 alpha - root(1/4 tau + 1/12 alpha)(2) + 1/2 alpha tau (1/12 + tau/24 alpha - alpha/8 tau)). This idea substantially extends the class of weak keys presented by Nitaj (Africacrypt 2008) when Z = psi(p,q,u,v) = (p - u)(q - v). Further, we consider Z = psi(p, q, u, v) = N - pu - v to provide a new class of weak keys in RSA. This idea does not require any kind of factorization as used in Nitaj's work. A very conservative estimate for the number of such weak exponents is N0.75-epsilon, where epsilon > 0 is arbitrarily small for suitably large N.
The performance and complexity of two complex lattice reduction (LR) algorithms used in multiple input-multiple output (MIMO) detection are compared in this paper. The Seysen's algorithm (SA) has been previously p...
详细信息
ISBN:
(纸本)9781424414833
The performance and complexity of two complex lattice reduction (LR) algorithms used in multiple input-multiple output (MIMO) detection are compared in this paper. The Seysen's algorithm (SA) has been previously proposed as a low-complexity alternative to the real version of the Lenstra-Lenstra-Lovasz (lll) algorithm while providing a better performance in LR-aided linear detectors. However, this paper shows that the SA has a higher complexity than the complex version of the lll algorithm, due to its more computationally intensive preprocessing stage and its higher complexity per iteration. In addition, both the SA and the complex lll algorithm provide practically the same performance when used in LR-aided successive interference cancellation (SIC) detectors.
This paper proposes an improved lattice-reduction aided (LRA) MMSE detection with successive interference cancellation (SIC) using both the forward and the backward (F&B) reduction lll algorithms. We also apply a ...
详细信息
ISBN:
(纸本)9781424426805
This paper proposes an improved lattice-reduction aided (LRA) MMSE detection with successive interference cancellation (SIC) using both the forward and the backward (F&B) reduction lll algorithms. We also apply a simple list detection to the F&B-LRA MMSE with SIC. The proposed detector provides good BER performance relatively close to that with the ML detection for both QPSK and 16QAM in the 8x8 MIMO system.
This paper proposes an improved lattice-reduction aided (LRA) MMSE detection based on the Gram-Schmidt orthogonalization. With the proposed detection, much reliable estimate can be achieved, compared to the convention...
详细信息
ISBN:
(纸本)9781424426805
This paper proposes an improved lattice-reduction aided (LRA) MMSE detection based on the Gram-Schmidt orthogonalization. With the proposed detection, much reliable estimate can be achieved, compared to the conventional LRA detection. The BERs are much closer to those with the ML detection in the 4x4 MIMO and the 8x8 MIMO systems.
Lattice reduction aided (LRA) detection with the lll algorithm has been investigated to achieve the MIMO channel capacity with low computational complexity. This paper proposes an improved LRA-MMSE detection using the...
详细信息
ISBN:
(纸本)9781424426430
Lattice reduction aided (LRA) detection with the lll algorithm has been investigated to achieve the MIMO channel capacity with low computational complexity. This paper proposes an improved LRA-MMSE detection using the forward and the backward reduction lll algorithms for the 8x8 MIMO to obtain more reliable estimates of the transmitted signals. The proposed method achieved much better BERs than the conventional LRA detection. The transmit signal energy could be saved about 3.5dB at BER=10(-5), and the BER slope became much steeper, which is almost the same as that with the maximum likelihood detection.
暂无评论