## Abstract

Lattice problems are considered as the key elements in many areas of computer science as well as in cryptography; the most important of which is the shortest vector problem (called SVP in short) and its approximate variants. Algorithms for this problem are known as lattice reduction algorithms. Currently, the most practical lattice reduction algorithm for such problems is the Block-Korkine-Zolotarev (BKZ) algorithm and its variants. Preprocessing is a technique that can be applied to certain lattice reduction algorithms (such as BKZ variants) to reduce the search time in the enumeration tree for a shortest vector. We optimize both the pruning and the preprocessing parameters of the recursive (aborted, extreme pruned) preprocessing of the BKZ lattice reduction algorithm and improve the results from Asiacrypt'11 by Chen and Nguyen.

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

Title of host publication | EICT 2015 |

Subtitle of host publication | proceedings of the 2nd International Conference on Electrical Information and Communication Technologies |

Place of Publication | Piscataway, NJ |

Publisher | Institute of Electrical and Electronics Engineers (IEEE) |

Pages | 19-23 |

Number of pages | 5 |

ISBN (Electronic) | 9781467392570, 9781467392556 |

ISBN (Print) | 9781467392563 |

DOIs | |

Publication status | Published - 2015 |

Externally published | Yes |

Event | 2nd International Conference on Electrical Information and Communication Technologies, EICT 2015 - Khulna, Bangladesh Duration: 10 Dec 2015 → 12 Dec 2015 |

### Other

Other | 2nd International Conference on Electrical Information and Communication Technologies, EICT 2015 |
---|---|

Country | Bangladesh |

City | Khulna |

Period | 10/12/15 → 12/12/15 |