{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:35:51Z","timestamp":1740137751285,"version":"3.37.3"},"reference-count":33,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"vor","delay-in-days":259,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2021,7,29]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>In this paper, we present a new variant of the Niederreiter Public Key Encryption (PKE) scheme which is resistant against recent attacks. The security is based on the hardness of the Rank Syndrome Decoding (RSD) problem and it presents a (<jats:italic>u<\/jats:italic>|<jats:italic>u<\/jats:italic>+<jats:italic>\u03c5<\/jats:italic>)-construction code using two different types of codes: Ideal Low Rank Parity Check (ILRPC) codes and<jats:italic>\u03bb<\/jats:italic>-Gabidulin codes. The proposed encryption scheme benefits are a larger minimum distance, a new efficient decoding algorithm and a smaller ciphertext and public key size compared to the Loidreau\u2019s variants and to its IND-CCA secure version.<\/jats:p>","DOI":"10.1051\/ita\/2021010","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T07:57:55Z","timestamp":1631865475000},"page":"10","source":"Crossref","is-referenced-by-count":3,"title":["A Novel Niederreiter-like cryptosystem based on the (<i>u<\/i>|<i>u<\/i>+<i>\u03c5<\/i>)-construction codes"],"prefix":"10.1051","volume":"55","author":[{"given":"Roumaissa","family":"Mahdjoubi","sequence":"first","affiliation":[]},{"given":"Pierre Louis","family":"Cayrel","sequence":"additional","affiliation":[]},{"given":"Sedat","family":"Akleylek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1482-7565","authenticated-orcid":false,"given":"Guenda","family":"Kenza","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"key":"R1","unstructured":"Aguilar-Melchor C., Aragon N., Bettaieb S., Bidoux L., Blazy O., Deneuville J.C., Gaborit P. and Z\u00e9mor G., Rank quasi-cyclic (rqc) (2017), https:\/\/pqc-rqc.org\/doc\/rqc-specification2017-11-30.pdf."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Al Shehhi H., Bellini E., Borba F., Caullery F., Manzano M. and Mateu V., An IND-CCA-secure code-based encryption scheme using rank metric. In: Buchmann J., Nitaj A., Rachidi T. (eds) Progress in Cryptology \u2013 AFRICACRYPT 2019. Vol. 11627 of Lecture Notes in Computer Science. Springer (2019).","DOI":"10.1007\/978-3-030-23696-0_5"},{"key":"R3","unstructured":"Aragon N., Blazy O., Deneuville J.C., Gaborit P., Hauteville A., Ruatta O., Tillich J.P., Z\u00e9mor G., Aguilar Melchor C., Bettaieb S., Bidoux L., Magali B. and Otmani A., ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call (2019), https:\/\/pqc-rollo.org."},{"key":"R4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"Aragon","year":"2005","journal-title":"Des. Codes Cryptogr"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Bardet M., Bros M., Cabarcas D., Gaborit P., Perlner R., Smith-Tone D., Tillich J.-P. and Verbel J., Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems. ASIACRYPT 2020, Vol. 12491 of LNCS. Springer (2020) 507\u2013536.","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"R6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"Berger","year":"2005","journal-title":"Designs Codes Cryptogr"},{"key":"R7","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"Berlekamp","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Chabaud F. and Stern J., The cryptographic security of the syndrome decoding problem for rank distance codes. ASIACRYPT (1996) 368\u2013381.","DOI":"10.1007\/BFb0034862"},{"key":"R9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10623-007-9160-8","volume":"48","author":"Gabidulin","year":"2008","journal-title":"Des. Codes Cryptogr"},{"key":"R10","doi-asserted-by":"crossref","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"Gabidulin","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"R11","unstructured":"Gaborit P., Murat G., Ruatta O. and Z\u00e9mor G., Low rank parity-check codes and their application to cryptography. In The International Workshop on Coding and Cryptography (WCC 13), Bergen, Norway (2013) 13 p. hal-00913719."},{"key":"R12","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"Gaborit","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"R13","doi-asserted-by":"crossref","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"Gaborit","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"R14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"Gibson","year":"1995","journal-title":"Des. Codes Cryptogr"},{"key":"R15","first-page":"212","volume":"1070","author":"Gibson","year":"1996","journal-title":"EUROCRYPT\u201996, LNCS"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Hauteville A. and Tillich J-P., New algorithms for decoding in the rank-metric and an attack on the LRPC-PKC. IEEE ISIT (2015).","DOI":"10.1109\/ISIT.2015.7282956"},{"key":"R17","doi-asserted-by":"crossref","first-page":"1250185","DOI":"10.1142\/S021949881250185X","volume":"12","author":"Hernando","year":"2013","journal-title":"J. Algebra Appl"},{"key":"R18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10623-017-0343-7","volume":"86","author":"Horlemann-Trautmann","year":"2018","journal-title":"Des. Codes Cryptogr"},{"key":"R19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10623-012-9757-4","volume":"70","author":"Kan","year":"2014","journal-title":"Des. Codes Cryptogr"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Lau T.S.C. and Tan C.H, A new Gabidulin-like code and its application in cryptography. In: Carlet C., Guilley S., Nitaj A., Souidi E. (eds) Codes, Cryptology and Information Security. C2SI 2019. Vol. 11445 of Lecture Notes in Computer Science. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-16458-4\u02d916.","DOI":"10.1007\/978-3-030-16458-4_16"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Liu J., Wang Y., Yi Z. and Lin Z., polarRLCE: a new code-based cryptosystem using polar codes. Secur. Commun. Netw. (2019) Article ID 3086975 https:\/\/doi.org\/10.1155\/2019\/3086975.","DOI":"10.1155\/2019\/3086975"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Loidreau P., A new rank metric codes based encryption scheme. PQCrypto, Utrecht, Netherlands (2017) 3\u201317.","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"R23","unstructured":"Loidreau P., M\u00e9trique rang et cryptographie. HDR thesis, France (2007)."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Marquez-Corbella I. and Tillich J-P, Using Reed-Solomon codes in the (u|u + v) construction and an application to cryptography. IEEE International Symposium on Information Theory (ISIT) (2016).","DOI":"10.1109\/ISIT.2016.7541435"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Marsaglia G., Bounds for the rank of the sum of two matrices, No. D1-82-0343. In Boeing Scientific Research Labs, Seattle, WA (1964).","DOI":"10.21236\/AD0600471"},{"key":"R26","first-page":"293","volume":"8","author":"McEliece","year":"1978","journal-title":"Des. Codes Cryptogr"},{"key":"R27","first-page":"157","volume":"15","author":"Niederreiter","year":"1986","journal-title":"Prob. Contr. Inform. Theory"},{"key":"R28","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1007\/s10623-017-0434-5","volume":"86","author":"Otmani","year":"2018","journal-title":"Des. Codes Cryptogr"},{"key":"R29","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"Ourivski","year":"2002","journal-title":"Prob. Inf. Trans"},{"key":"R30","first-page":"50","volume":"3715","author":"Overbeck","year":"2005","journal-title":"Mycrypt"},{"key":"R31","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"Overbeck","year":"2008","journal-title":"J. Cryptology"},{"key":"R32","doi-asserted-by":"crossref","unstructured":"Silva D. and Kschischang F.R., Fast encoding and decoding of gabidulin codes. In IEEE International Symposium on Information Theory (2009) 2858\u20132862.","DOI":"10.1109\/ISIT.2009.5205272"},{"key":"R33","doi-asserted-by":"crossref","unstructured":"Wachter-Zeh A., Decoding of Block and Convolutional Codes in Rank Metric, Ph.D thesis, University of Rennes 1, France (2013).","DOI":"10.1109\/NETCOD.2012.6261875"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2021010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:25:09Z","timestamp":1725805509000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2021010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":33,"alternative-id":["ita200071"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2021010","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2021]]}}}