Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}

Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$

Published:2017 Issue: Volume: Page:96-109
ISSN:0302-9743
Container-title:Codes, Cryptology and Information Security
language:
Short-container-title:

Author:

Gueye Cheikh Thiécoumba,Klamti Jean Belo,Hirose Shoichi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-55589-8_7

Reference41 articles.

1. Andoni, A., Indyk, P., Nguyen, H.L., Razenshteyn, I.: Beyond locality-sensitive hashing. In: SODA, pp. 1018–1028 (2014)

2. Lecture Notes in Computer Science;TP Berger,2009

3. Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theor. 24(3), 384–386 (1978)

4. Becker, A., Joux, A., May, A., Meurer A.: Decoding random binary linear codes in $$2n, 20$$ : how $$1+1=0$$ improves information set decoding. In: Eurocrypt 2012 (2012)

5. Lecture Notes in Computer Science;DJ Bernstein,2011

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Elliptic code-based oblivious polynomial evaluation;Computer Standards & Interfaces;2024-08

2. Reducing the Keysize of McEliece Cryptosystem with Improved Patterson’s Algorithm;2023 International Conference on Data Security and Privacy Protection (DSPP);2023-10-16

3. New code-based cryptosystems via the IKKR framework;Journal of Information Security and Applications;2023-08

4. Generic Decoding of Restricted Errors;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

5. Improved Information Set Decoding Algorithms over Galois Ring in the Lee Metric;Journal of Systems Science and Complexity;2023-04-24