Expanded low-rank parity-check codes and their application to cryptography

References

• Aguilar, C., O. Blazy, J. Deneuville, P. Gaborit, and G. Zémor. 2018. Efficient encryption from random quasi-cyclic codes. IEEE Transactions on Information Theory 64 (5):3927–43, May. doi:10.1109/TIT.2018.2804444.
   Web of Science ®Google Scholar
• Albrecht, M., C. Cid, K. G. Paterson, C. Tjhai, and M. Tomlisson. 2018. Nts-kem. NIST PQC Round 2:4–13.
   Google Scholar
• Aragon, N., P. Gaborit, A. Hauteville, and J. Tillich. 2018. A new algorithm for solving the rank syndrome decoding problem. In 2018 IEEE International Symposium on Information Theory (ISIT), 2421–2425. doi:10.1109/ISIT.2018.8437464.
   Google Scholar
• Aragon, N., P. Barreto, S. Bettaied, L. Bidoux, O. Blazy, J.-C. Deneuville, P. Gaborit, S. Gueron, T. Guneysu, C. A. Melchor, et al. 2017. Bike: Bit flipping key encapsulation.
   Google Scholar
• Aragon, N., and P. Gaborit. 2019. A key recovery attack against lrpc using decryption failures. In International Workshop on Coding and Cryptography (WCC 2019), Saint-Jacut-de-la-Mer, Norway.
   Google Scholar
• Aragon, N., P. Gaborit, A. Hauteville, O. Ruatta, and G. Zémor. 2019. Low rank parity check codes: New decoding algorithms and applications to cryptography. IEEE Transactions on Information Theory 65 (12):7697–717. doi:10.1109/TIT.2019.2933535.
   Web of Science ®Google Scholar
• Bardet, M., M. Bros, D. Cabarcas, P. Gaborit, R. Perlner, D. Smith-Tone, J. Tillich, and J. Verbel. 2020. Improvements of algebraic attacks for solving the rank decoding and minrank problems. In Advances in Cryptology – ASIACRYPT 2020, Cham, ed. S. Moriai and H. Wang, 507–36. Springer International Publishing.
   Google Scholar
• Berger, T., P. Gaborit, and O. Ruatta. 2017. Gabidulin matrix codes and their application to small ciphertext size cryptosystems. In Progress in Cryptology – INDOCRYPT 2017, Cham, ed. A. Patra and N. P. Smart, 247–66. Springer International Publishing.
   Google Scholar
• Gabidulin, E. 1985. Theory of codes with maximum rank distance. Problemy peredachi informatsii 21:3–16.
   Google Scholar
• Gabidulin, E., A. Paramonov, and O. Tretjakov. 1991. Ideals over a non-commutative ring and their application in cryptology. In Proceedings of advances in Cryptology-EUROCRYPT’91. Vol. 547, ed. D. Davies, 482–9.
   Google Scholar
• Gaborit, P., G. Murat, O. Ruatta, and G. Zémor. 2013. Low rank parity check codes and their application to cryptography. In Proceedings of the Workshop on Coding and Cryptography WCC’2013, Norway. Bergen.
   Google Scholar
• Gaborit, P., O. Ruatta, J. Schrek, and G. Zémor. 2016. New results for rank-based cryptography. In AFRICACRYPT 2014: Progress in Cryptology. Vol. 8469, ed. Springer, 1–12. Cham.
   Google Scholar
• Hall, J. 2003. Notes on coding theory. FreeTechBooks.com.
   Google Scholar
• Hauteville, A., and J. Tillich. 2015. New algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem. In IEEE International Symposium on Information Theory - ISIT 2015, 2747–51.
   Google Scholar
• Khathuria, K., J. Rosenthal, and V. Weger. 2021. Encryption scheme based on expanded Reed-Solomon codes. Advances in Mathematics of Communications 15 (2):207–18. doi:10.3934/amc.2020053.
   Web of Science ®Google Scholar
• Kim, J.-L., Y.-S. Kim, L. Galvez, M. J. Kim, and N. Lee. 2018. Mcnie: A code-based public-key cryptosystem. arXiv preprint arXiv:1812.05008.
   Google Scholar
• Lau, T., and C. Tan. 2018. Key recovery attack on McNie based on low rank parity check codes and its reparation. In Advances in Information and Computer Security: 13th International Workshop on Security, IWSEC 2018, Sendai, Japan.
   Google Scholar
• McEliece, R. 1978. A public-key cryptosystem based on algebraic coding theory. In Jet Propulsion Laboratory DSN Progress Report, 114–6.
   Google Scholar
• Melchor, C., N. Aragon, M. Bardet, S. Bettaieb, L. Bidoux, O. Blazy, J.-C. Deneuville, P. Gaborit, A. Hauteville, A. Otmani, et al. 2018. Rollo-rank-ouroboros. In LAKE & LOCKER.
   Google Scholar
• Mullen, G., and D. Panario. 2013. Handbook of finite fields. CRC Press.
   Google Scholar
• Overbeck, R. 2005. A new structural attack for GPT and variants. In Progress in cryptology – mycrypt 2005, ed. Dawson and S. Vaudenay, 50–63. Berlin: Heidelberg.
   Google Scholar
• Samardjiska, S., P. Santini, E. Persichetti, and G. Banegas. 2019. A reaction attack against cryptosystems based on LRPC codes. In Progress in Cryptology–LATINCRYPT 2019: 6th International Conference on Cryptology and Information Security in Latin America, Santiago de Chile, Chile.
   Google Scholar
• Wu, Y. 2011. On expanded cyclic and reedsolomon codes. IEEE Transactions on Information Theory 57 (2):601–20. March) doi:10.1109/TIT.2010.2095150.
   Web of Science ®Google Scholar