椭圆法基的复杂性

arXiv - CS - Information Theory Pub Date : 2024-01-22 DOI:arxiv-2401.11872

Daniel Panario, Mohamadou Sall, Qiang Wang

{"title":"椭圆法基的复杂性","authors":"Daniel Panario, Mohamadou Sall, Qiang Wang","doi":"arxiv-2401.11872","DOIUrl":null,"url":null,"abstract":"We study the complexity (that is, the weight of the multiplication table) of\nthe elliptic normal bases introduced by Couveignes and Lercier. We give an\nupper bound on the complexity of these elliptic normal bases, and we analyze\nthe weight of some special vectors related to the multiplication table of those\nbases. This analysis leads us to some perspectives on the search for low\ncomplexity normal bases from elliptic periods.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The complexity of elliptic normal bases\",\"authors\":\"Daniel Panario, Mohamadou Sall, Qiang Wang\",\"doi\":\"arxiv-2401.11872\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the complexity (that is, the weight of the multiplication table) of\\nthe elliptic normal bases introduced by Couveignes and Lercier. We give an\\nupper bound on the complexity of these elliptic normal bases, and we analyze\\nthe weight of some special vectors related to the multiplication table of those\\nbases. This analysis leads us to some perspectives on the search for low\\ncomplexity normal bases from elliptic periods.\",\"PeriodicalId\":501433,\"journal\":{\"name\":\"arXiv - CS - Information Theory\",\"volume\":\"4 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2401.11872\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2401.11872","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了库维涅（Couveignes）和勒塞尔（Lercier）引入的椭圆正基的复杂性（即乘法表的权重）。我们给出了这些椭圆正基复杂性的上界，并分析了与这些基的乘法表有关的一些特殊向量的权重。这一分析为我们从椭圆周期中寻找低复杂度正基提供了一些视角。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The complexity of elliptic normal bases

We study the complexity (that is, the weight of the multiplication table) of the elliptic normal bases introduced by Couveignes and Lercier. We give an upper bound on the complexity of these elliptic normal bases, and we analyze the weight of some special vectors related to the multiplication table of those bases. This analysis leads us to some perspectives on the search for low complexity normal bases from elliptic periods.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Information Theory

自引率

0.00%

发文量