{"title":"利用椭圆曲线与三类虚二次域的复乘法证明初等性","authors":"Hiroshi Onuki","doi":"10.1016/j.ffa.2024.102490","DOIUrl":null,"url":null,"abstract":"<div><p>In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain algorithms for elliptic curves with complex multiplication by imaginary quadratic field of class numbers one and two, but, they were not able to obtain primality proving algorithms in cases of higher class number. In this paper, we present a method to apply their framework to imaginary quadratic fields of class number three. In particular, our method provides a more efficient primality proving algorithm for special sequences of integers than the existing algorithms by using an imaginary quadratic field of class number three in which 2 splits. As an application, we give two special sequences of integers derived from <span><math><mi>Q</mi><mo>(</mo><msqrt><mrow><mo>−</mo><mn>23</mn></mrow></msqrt><mo>)</mo></math></span> and <span><math><mi>Q</mi><mo>(</mo><msqrt><mrow><mo>−</mo><mn>31</mn></mrow></msqrt><mo>)</mo></math></span>, which are all the imaginary quadratic fields of class number three in which 2 splits. Finally, we give a computational result for the primality of these sequences.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"99 ","pages":"Article 102490"},"PeriodicalIF":1.2000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three\",\"authors\":\"Hiroshi Onuki\",\"doi\":\"10.1016/j.ffa.2024.102490\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain algorithms for elliptic curves with complex multiplication by imaginary quadratic field of class numbers one and two, but, they were not able to obtain primality proving algorithms in cases of higher class number. In this paper, we present a method to apply their framework to imaginary quadratic fields of class number three. In particular, our method provides a more efficient primality proving algorithm for special sequences of integers than the existing algorithms by using an imaginary quadratic field of class number three in which 2 splits. As an application, we give two special sequences of integers derived from <span><math><mi>Q</mi><mo>(</mo><msqrt><mrow><mo>−</mo><mn>23</mn></mrow></msqrt><mo>)</mo></math></span> and <span><math><mi>Q</mi><mo>(</mo><msqrt><mrow><mo>−</mo><mn>31</mn></mrow></msqrt><mo>)</mo></math></span>, which are all the imaginary quadratic fields of class number three in which 2 splits. Finally, we give a computational result for the primality of these sequences.</p></div>\",\"PeriodicalId\":50446,\"journal\":{\"name\":\"Finite Fields and Their Applications\",\"volume\":\"99 \",\"pages\":\"Article 102490\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite Fields and Their Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1071579724001291\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579724001291","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain algorithms for elliptic curves with complex multiplication by imaginary quadratic field of class numbers one and two, but, they were not able to obtain primality proving algorithms in cases of higher class number. In this paper, we present a method to apply their framework to imaginary quadratic fields of class number three. In particular, our method provides a more efficient primality proving algorithm for special sequences of integers than the existing algorithms by using an imaginary quadratic field of class number three in which 2 splits. As an application, we give two special sequences of integers derived from and , which are all the imaginary quadratic fields of class number three in which 2 splits. Finally, we give a computational result for the primality of these sequences.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.