Elliptic periods for finite fields
Author:
Publisher
Elsevier BV
Subject
Applied Mathematics,General Engineering,Algebra and Number Theory,Theoretical Computer Science
Reference22 articles.
1. L.M. Adleman, H.W. Lenstra, Finding irreducible polynomials over finite fields, in: Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, 1986, pp. 350–355
2. Low complexity normal basis;Ash;Discrete Appl. Math.,1989
3. An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields;Ballet;Theoret. Comput. Sci.,2006
4. Handbook of Magma Functions;Canon,2008
5. On fast multiplication of polynomials over arbitrary algebras;Cantor;Acta Inform.,1991
Cited by 23 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline Cohomology;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24
2. The equivariant complexity of multiplication in finite field extensions;Journal of Algebra;2023-05
3. On Decoding High-Order Interleaved Sum-Rank-Metric Codes;Code-Based Cryptography;2023
4. Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms;Advances in Mathematics of Communications;2022
5. Rank-Metric Codes and Their Applications;Foundations and Trends® in Communications and Information Theory;2022
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3