A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography-Reference-Cited by-同舟云学术

A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography

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

Author:

Berger Thierry P.,Gueye Cheikh Thiécoumba,Klamti Jean Belo

Publisher

Springer International Publishing

Link

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

Reference25 articles.

1. Barg, A.: Some new NP-complete coding problems. Problemy Peredachi Informatsii 30(3), 23–28 (1994). English translation in Probl. Inform. Trans. 30, 209–214, July–September 1994

2. Berger, T.P.: New perspectives for code-based public key cryptography. In: Codes and Lattices in Cryptography, CLC 2006, Darmstadt (2006)

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

4. Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Des. Codes Crypt. 35, 63–79 (2005)

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

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

1. SoK: CryptographicEstimators -- a Software Library for Cryptographic Hardness Estimation;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

2. PERK: compact signature scheme based on a new variant of the permuted kernel problem;Designs, Codes and Cryptography;2024-03-27

3. Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems;IEEE Transactions on Information Theory;2023

4. A code-based hybrid signcryption scheme;Journal of Mathematical Cryptology;2023-01-01

5. Security Analysis of a Cryptosystem Based on Subspace Subcodes;Code-Based Cryptography;2022