Welcome to the resource topic for
**2016/237**

**Title:**

May-Ozerov Algorithm for Nearest-Neighbor Problem over \mathbb{F}_{q} and Its Application to Information Set Decoding

**Authors:**
Shoichi Hirose

**Abstract:**

May and Ozerov proposed an algorithm for the nearest-neighbor problem of vectors over the binary field at EUROCRYPT 2015. They applied their algorithm to the decoding problem of random linear codes over the binary field and confirmed the performance improvement. We describe their algorithm generalized to work for vectors over the finite field \mathbb{F}_{q} with arbitrary prime power q. We also apply the generalized algorithm to the decoding problem of random linear codes over \mathbb{F}_{q}. It is observed by our numerical analysis of asymptotic time complexity that the May-Ozerov nearest-neighbor algorithm may not contribute to the performance improvement of the Stern information set decoding over \mathbb{F}_{q} with q\geq 3.

**ePrint:**
https://eprint.iacr.org/2016/237

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .