## Abstract

We present a new algorithm for solving the closest vector problem. The algorithm is called the double-plane algorithm and it is an extension of Babai's nearest plane algorithm. The algorithm is an approximative algorithm, and the performance of the algorithm depends on the quality of the lattice basis. However, given a high quality basis, the algorithm achieves correctness for lattices of sufficiently low rank, and very low error-rates when correctness can no longer be achieved. The computational complexity of the double-plane algorithm is upper bounded by that of sphere decoding using the Schnorr-Euchner enumeration strategy, and the higher the rank of the lattice, the larger the gap between the complexities of these decoding algorithms.

Original language | English |
---|---|

Title of host publication | Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 |

Publisher | IEEE |

Pages | 193-197 |

Number of pages | 5 |

ISBN (Electronic) | 9784885523182 |

DOIs | |

Publication status | Published - 8 Mar 2019 |

MoE publication type | A4 Article in a conference publication |

Event | International Symposium on Information Theory and Its Applications - Singapore, Singapore Duration: 28 Oct 2018 → 31 Oct 2018 Conference number: 15 |

### Conference

Conference | International Symposium on Information Theory and Its Applications |
---|---|

Abbreviated title | ISITA |

Country | Singapore |

City | Singapore |

Period | 28/10/2018 → 31/10/2018 |