{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:51:48Z","timestamp":1713293508762},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T00:00:00Z","timestamp":1574985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T00:00:00Z","timestamp":1574985600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s00200-019-00406-x","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T03:03:02Z","timestamp":1574996582000},"page":"147-156","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A modified Dual-Ouroboros public-key encryption using Gabidulin codes"],"prefix":"10.1007","volume":"32","author":[{"given":"Jon-Lark","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Sik","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucky Erap","family":"Galvez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myeong Jae","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,29]]},"reference":[{"key":"406_CR1","unstructured":"Aguilar Melchor, C., Aragon, N., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.C., Gaborit, P., Hauteville, A., Z\u00e9mor, G.: Ouroboros-R. http:\/\/pqc-ouroborosr.org\/. Accessed 21 Nov 2019"},{"key":"406_CR2","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville A., Tillich, J.P.: Improvement of the generic attacks for the rank syndrome decoding problem (2017), $$\\langle \\text{hal-01608464}\\rangle $$","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"406_CR3","doi-asserted-by":"crossref","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$: how 1 + 1 = 0 improves information set decoding. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 520\u2013536. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"406_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems (Corresp.). IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"406_CR5","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"PH Delsarte","year":"1978","unstructured":"Delsarte, P.H.: Bilinear Forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25, 226\u2013241 (1978)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"406_CR6","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985)","journal-title":"Problemy Peredachi Informatsii"},{"key":"406_CR7","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a noncommutative ring and their applications to cryptography. In: Proceedings of Eurocrypt, LNCS, vol. 547, pp. 482\u2013489, Springer (1991)","DOI":"10.1007\/3-540-46416-6_41"},{"key":"406_CR8","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2020021","author":"P Gaborit","year":"2019","unstructured":"Gaborit, P., Galvez, L., Hauteville, A., Kim, J.-L., Kim, M.J., Kim, Y.-S.: Dual-Ouroboros: an improvement of the McNie scheme. Adv. Math. Commun. (2019). https:\/\/doi.org\/10.3934\/amc.2020021","journal-title":"Adv. Math. Commun."},{"issue":"12","key":"406_CR9","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Zemor, G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inf. Theory 62(12), 7245\u20137252 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"406_CR10","doi-asserted-by":"crossref","unstructured":"Lau, T.S.C., Tan, C.H.: Key recovery attack on McNie based on low rank parity check codes and its reparation. In: International Workshop on Security, pp. 19\u201334. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-97916-8_2"},{"key":"406_CR11","unstructured":"LEDAcryptc cryptosystem website, https:\/\/www.ledacrypt.org\/LEDAcrypt\/. Accessed 21 Nov 2019"},{"key":"406_CR12","doi-asserted-by":"crossref","unstructured":"Loidreau, P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In: International Workshop on Coding and Cryptography, pp. 36\u201345. Springer, Berlin (2005)","DOI":"10.1007\/11779360_4"},{"key":"406_CR13","first-page":"114","volume":"42\u201344","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42\u201344, 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"key":"406_CR14","unstructured":"McNie comment from https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions, read official comments on McNie dated Dec 24, 2017 and (Dec. 26, 2017)"},{"key":"406_CR15","unstructured":"McNie and other cryptosystems, https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Post-Quantum-Cryptography-Standardization. Accessed 21 Nov 2019"},{"key":"406_CR16","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.S.: Compact McEliece keys from Goppa codes. In: Selected Areas in Cryptography, pp. 376\u2013392 (2009)","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"406_CR17","unstructured":"NIST Post-quantum cryptography standardization website https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions. Accessed 21 Nov 2019"},{"key":"406_CR18","doi-asserted-by":"crossref","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: International Conference on Cryptology in Malaysia, pp. 50\u201363. Springer, Berlin (2005)","DOI":"10.1007\/11554868_5"},{"issue":"2","key":"406_CR19","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptol."},{"key":"406_CR20","unstructured":"ROLLO cryptosystem website, https:\/\/pqc-rollo.org\/ Accessed 21 Nov 2019"},{"key":"406_CR21","doi-asserted-by":"crossref","unstructured":"Silva, D., Kschischang, F.R.: Fast encoding and decoding of Gabidulin codes. In: 2009 IEEE International Symposium on Information Theory, pp. 2858\u20132862. IEEE (2009)","DOI":"10.1109\/ISIT.2009.5205272"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00406-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-019-00406-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00406-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T10:19:15Z","timestamp":1613729955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-019-00406-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,29]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s00200-019-00406-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,29]]},"assertion":[{"value":"20 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}