{"id":99,"date":"2021-11-23T08:31:36","date_gmt":"2021-11-23T08:31:36","guid":{"rendered":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/?p=99"},"modified":"2021-11-23T08:31:36","modified_gmt":"2021-11-23T08:31:36","slug":"monomial-codes","status":"publish","type":"post","link":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/2021\/11\/23\/monomial-codes\/","title":{"rendered":"Monomial codes"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Self-dual monomial codes and their use in cryptography<\/h2>\n\n\n\n<p>The purpose of this section is to analyze structural properties of recently proposed monomial self-dual codes. The results we obtained were accepted for publication at <a href=\"https:\/\/ima.org.uk\/16366\/online-event-18th-ima-international-conference-on-cryptography-and-coding\/\">IMACC 2021<\/a>.<\/p>\n\n\n\n<p>The article focuses on the self-dual monomial codes that have an underlying structure of<br>decreasing\/weakly decreasing monomial codes. Having such a property permits an in-depth<br>analysis of their structure: The permutation group of a subclass is (significantly) bigger than the<br>affine group. Upon looking at higher powers of the code, we see that its third power is the entire<br>space, but the dual of the square code gives information helpful for decoding. Using operations<br>such as shortening, puncturing and taking the discrete derivative, we extract the subcode<br>generated by the multiples of a certain variable. Recently, self-dual monomial codes have been<br>proposed for a McEliece public key encryption scheme. They seem to possess strong security<br>features &#8211; they have a large permutation group, they are self-dual, there are exponentially many of<br>them by counting the possible monomial bases used in their construction. A more detailed analysis<br>allows us to identify subclasses where the square code and shortening methods yield non-trivial<br>results; in these cases, the security is dominated by the complexity of the Information Set<br>Decoding, which is exponential in the square root of the length of the code. This is a solid<br>argument for the security of the McEliece variant based on self-dual monomial codes.<\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Self-dual monomial codes and their use in cryptography The purpose of this section is to analyze structural properties of recently [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-99","post","type-post","status-publish","format-standard","hentry","category-updates"],"_links":{"self":[{"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/posts\/99","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/comments?post=99"}],"version-history":[{"count":1,"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/posts\/99\/revisions"}],"predecessor-version":[{"id":100,"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/posts\/99\/revisions\/100"}],"wp:attachment":[{"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/media?parent=99"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/categories?post=99"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/codebasedcrypto.uav.ro\/wordpress\/wp-json\/wp\/v2\/tags?post=99"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}