Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Advanced receiver algorithms for MIMO wireless communications
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Algebraic number theory and code design for Rayleigh fading channels
Communications and Information Theory
System architecture and implementation of MIMO sphere decoders on FPGA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection
IEEE Transactions on Signal Processing
Identifiability and aliasing in polynomial-phase signals
IEEE Transactions on Signal Processing
On further reduction of complexity in tree pruning based sphere search
IEEE Transactions on Communications
A hybrid lattice-reduction and meet-in-the-middle attack against NTRU
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A new decoding algorithm in MIMO-ZP-OFDM systems
ICDHM'07 Proceedings of the 1st international conference on Digital human modeling
Highly parallel decoding of space-time codes on graphics processing units
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Frequency estimation by phase unwrapping
IEEE Transactions on Signal Processing
Multi-strata codes: space-time block codes with low detection complexity
IEEE Transactions on Communications
Iterative MIMO sphere decoding throughput guarantees under realistic channel conditions
IEEE Communications Letters
Polynomial-phase estimation, phase unwrapping and the nearest lattice point problem
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Faster exponential time algorithms for the shortest vector problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
Solving Ellipsoid-Constrained Integer Least Squares Problems
SIAM Journal on Matrix Analysis and Applications
Lattice reduction algorithms: theory and practice
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Lattice enumeration using extreme pruning
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
BKZ 2.0: better lattice security estimates
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Parallel High Throughput Soft-Output Sphere Decoding Algorithm
Journal of Signal Processing Systems
| Hi-index | 0.07 |
The problem of determining shortest vectors and reduced bases or successive minima of lattices often occurs in algebra and number theory. Nevertheless, computational methods for the solution hardly exist in the literature. It is the aim of this paper to develop efficient algorithms for this purpose.