{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:58Z","timestamp":1773377038884,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001665","name":"ANR","doi-asserted-by":"publisher","award":["482022"],"award-info":[{"award-number":["482022"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195285","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["An Analysis of a Generalization of Loidreau's Encryption Scheme"],"prefix":"10.1109","author":[{"given":"Kayod\u00e9 Epiphane","family":"Nouetowa","sequence":"first","affiliation":[{"name":"Univ Rennes,CNRS, IRMAR - UMR 6625,Rennes,France,F-35000"}]},{"given":"Pierre","family":"Loidreau","sequence":"additional","affiliation":[{"name":"DGA and Univ Rennes,CNRS, IRMAR - UMR 6625,Rennes,France,F-35000"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0434-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00781-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-021-00972-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-022-00577-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-40003-2_2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01330-5"},{"issue":"1","key":"ref9","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Probl. Inf. Transm."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01390769"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_19"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206029"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01265-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81293-5_23"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195285.pdf?arnumber=11195285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:14Z","timestamp":1773347414000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195285\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195285","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}