Optimization of $$\mathsf {LPN}$$ Solving Algorithms
| Autor: | Sonia Bogos, Serge Vaudenay |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Theoretical computer science
business.industry 020206 networking & telecommunications Cryptography 0102 computer and information sciences 02 engineering and technology Covering code 01 natural sciences Linear code 010201 computation theory & mathematics Hadamard transform Path (graph theory) 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) Focus (optics) business Algorithm Time complexity Mathematics |
| Zdroj: | Advances in Cryptology – ASIACRYPT 2016 ISBN: 9783662538869 ASIACRYPT (1) |
| DOI: | 10.1007/978-3-662-53887-6_26 |
| Popis: | In this article we focus on constructing an algorithm that automatizes the generation of \(\mathsf {LPN}\) solving algorithms from the considered parameters. When searching for an algorithm to solve an \(\mathsf {LPN}\) instance, we make use of the existing techniques and optimize their use. We formalize an \(\mathsf {LPN}\) algorithm as a path in a graph G and our algorithm is searching for the optimal paths in this graph. Our results bring improvements over the existing work, i.e. we improve the results of the covering code from ASIACRYPT’14 and EUROCRYPT’16. Furthermore, we propose concrete practical codes and a method to find good codes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|