標(biāo)題: Titlebook: Algorithmic Number Theory; 6th International Sy Duncan Buell Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 2004 Farey seque [打印本頁(yè)] 作者: urinary-tract 時(shí)間: 2025-3-21 18:18
書(shū)目名稱(chēng)Algorithmic Number Theory影響因子(影響力)
書(shū)目名稱(chēng)Algorithmic Number Theory影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Algorithmic Number Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory被引頻次
書(shū)目名稱(chēng)Algorithmic Number Theory被引頻次學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory年度引用
書(shū)目名稱(chēng)Algorithmic Number Theory年度引用學(xué)科排名
書(shū)目名稱(chēng)Algorithmic Number Theory讀者反饋
書(shū)目名稱(chēng)Algorithmic Number Theory讀者反饋學(xué)科排名
作者: browbeat 時(shí)間: 2025-3-21 23:14
https://doi.org/10.1007/978-3-540-73139-9This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of algebraic tori and abelian varieties.作者: 說(shuō)笑 時(shí)間: 2025-3-22 03:28 作者: 使長(zhǎng)胖 時(shí)間: 2025-3-22 07:19
Das ist der Content der Zukunft,We develop an algorithm for computing isomorphisms and automorphisms of algebraic function fields of transcendence degree one in characteristic zero and positive characteristic.作者: 脖子 時(shí)間: 2025-3-22 10:43 作者: curriculum 時(shí)間: 2025-3-22 13:31
Using Primitive Subgroups to Do More with Fewer BitsThis paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of algebraic tori and abelian varieties.作者: Inkling 時(shí)間: 2025-3-22 20:21 作者: HALL 時(shí)間: 2025-3-22 23:37 作者: ILEUM 時(shí)間: 2025-3-23 01:55 作者: Hyperalgesia 時(shí)間: 2025-3-23 07:08
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153005.jpg作者: ARCHE 時(shí)間: 2025-3-23 09:43
Elliptic Curves of Large Rank and Small Conductorng from 1.0136 (for .=6) to over 100 (for .=10 and .=11). We describe our search methods, and tabulate, for each .=5,6,...,11, the five curves of lowest conductor, and (except for .=11) also the five of lowest absolute discriminant, that we found.作者: FLAT 時(shí)間: 2025-3-23 14:29 作者: EPT 時(shí)間: 2025-3-23 21:58 作者: goodwill 時(shí)間: 2025-3-24 01:55 作者: CIS 時(shí)間: 2025-3-24 03:15 作者: 種植,培養(yǎng) 時(shí)間: 2025-3-24 09:40
Function Field Sieve in Characteristic Three identity based encryption systems using supersingular elliptic curves, we pay special attention to the case where . is composite. This allows us to represent the function field over different base fields. Practical experiments appear to show that a function field over . gives the best results.作者: 起波瀾 時(shí)間: 2025-3-24 13:20 作者: 連鎖 時(shí)間: 2025-3-24 15:51 作者: 按時(shí)間順序 時(shí)間: 2025-3-24 21:28
https://doi.org/10.1007/978-3-540-73139-9PP. As a consequence, we show that . for an ideal in . is in SPP. Furthermore, assuming the GRH, the class number of ., and a presentation for the class group of . can also be computed in SPP. A corollary of our result is that solving PELL’S EQUATION, recently shown by Hallgren [12] to have a quantu作者: 忘恩負(fù)義的人 時(shí)間: 2025-3-24 23:40 作者: 騙子 時(shí)間: 2025-3-25 05:14 作者: Seminar 時(shí)間: 2025-3-25 10:21 作者: multiply 時(shí)間: 2025-3-25 15:18 作者: ANTH 時(shí)間: 2025-3-25 16:59 作者: 引起痛苦 時(shí)間: 2025-3-25 23:35 作者: 碎石頭 時(shí)間: 2025-3-26 01:57
Die blaue Stunde der Informatikic curves ..: .. + .. = . of ranks 8, 9, 10, and 11 over??. As a corollary we produce examples of elliptic curves over?? with a rational 3-torsion point and rank as high as 11. We also discuss the problem of finding the minimal curve .. of a given rank, in the sense of both |.| and the conductor of 作者: 混合,攙雜 時(shí)間: 2025-3-26 04:33
,Kryptografie?– Schützen der Privatsph?re,ion, fastECPP, runs in heuristic time .. The aim of this article is to describe new ideas used when dealing with very large numbers. We illustrate these with the primality proofs of some numbers with more than 10,000 decimal digits.作者: anus928 時(shí)間: 2025-3-26 09:33
https://doi.org/10.1007/978-3-662-06516-7gorithm computes the group order of the Jacobian of a genus 2 curve over a finite field for which the characteristic polynomial of the Frobenius endomorphism is known modulo some integer. The main tool is a 2-dimensional pseudo-random walk that allows to heuristically choose random elements in a 2-d作者: Pcos971 時(shí)間: 2025-3-26 14:16
https://doi.org/10.1007/978-3-662-06516-7 identity based encryption systems using supersingular elliptic curves, we pay special attention to the case where . is composite. This allows us to represent the function field over different base fields. Practical experiments appear to show that a function field over . gives the best results.作者: FLINT 時(shí)間: 2025-3-26 19:10 作者: GRATE 時(shí)間: 2025-3-27 00:40
https://doi.org/10.1007/978-3-662-06514-3y turn to be particularly interesting for elliptic curves with complex multiplication, for which they provide very simple stable equations. The invariants associated to these models allow an easy construction of ring class fields of certain imaginary quadratic orders, with interesting theoretical co作者: 天真 時(shí)間: 2025-3-27 03:49
Algorithmic Number Theory978-3-540-24847-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 滲入 時(shí)間: 2025-3-27 08:21 作者: Infuriate 時(shí)間: 2025-3-27 09:49
https://doi.org/10.1007/978-3-540-73139-9PP. As a consequence, we show that . for an ideal in . is in SPP. Furthermore, assuming the GRH, the class number of ., and a presentation for the class group of . can also be computed in SPP. A corollary of our result is that solving PELL’S EQUATION, recently shown by Hallgren [12] to have a quantum polynomial-time algorithm, is also in SPP.作者: 符合規(guī)定 時(shí)間: 2025-3-27 16:41
https://doi.org/10.1007/978-3-540-73139-9elements in the Jacobian of a .. curve can be added with 150?multiplications and 2?inversions in the field of definition of the curve, while an element can be doubled with 174?multiplications and 2?inversions. In superelliptic curves, 10?multiplications are saved.作者: DENT 時(shí)間: 2025-3-27 18:35
https://doi.org/10.1007/978-3-540-73139-9 of weight bigger than?2, we are are led to make a precise conjecture about indexes of Hecke algebras in their normalisation which implies (if true) the surprising conjecture that there are no mod?. congruences between non-conjugate newforms in ..(Γ.(.)), but there are almost always many such congruences when the weight is bigger than?2.作者: 親屬 時(shí)間: 2025-3-27 23:13
,Kryptografie?– Schützen der Privatsph?re,ion, fastECPP, runs in heuristic time .. The aim of this article is to describe new ideas used when dealing with very large numbers. We illustrate these with the primality proofs of some numbers with more than 10,000 decimal digits.作者: indemnify 時(shí)間: 2025-3-28 02:57 作者: OGLE 時(shí)間: 2025-3-28 10:20
https://doi.org/10.1007/b98210Farey sequence; Prime; algebraic geometry; algebraic number fields; algebraic number theory; algorithmic 作者: 愛(ài)社交 時(shí)間: 2025-3-28 12:31
978-3-540-22156-2Springer-Verlag Berlin Heidelberg 2004作者: 改變 時(shí)間: 2025-3-28 14:41
Elliptic Curves of Large Rank and Small Conductorng from 1.0136 (for .=6) to over 100 (for .=10 and .=11). We describe our search methods, and tabulate, for each .=5,6,...,11, the five curves of lowest conductor, and (except for .=11) also the five of lowest absolute discriminant, that we found.作者: Crayon 時(shí)間: 2025-3-28 22:33
Binary GCD Like Algorithms for Some Complex Quadratic Rings?{???2,???7,???11,???19}. Thus a binary gcd like algorithm is presented for a unique factorization domain which is not Euclidean (case .=-19). Together with the earlier known binary gcd like algorithms for the ring of integers in . and ., one now has binary gcd like algorithms for all complex quadra作者: RADE 時(shí)間: 2025-3-29 02:34
On the Complexity of Computing Units in a Number FieldPP. As a consequence, we show that . for an ideal in . is in SPP. Furthermore, assuming the GRH, the class number of ., and a presentation for the class group of . can also be computed in SPP. A corollary of our result is that solving PELL’S EQUATION, recently shown by Hallgren [12] to have a quantu作者: objection 時(shí)間: 2025-3-29 06:21 作者: 宴會(huì) 時(shí)間: 2025-3-29 09:49 作者: Factual 時(shí)間: 2025-3-29 11:56
Rational Divisors in Rational Divisor Classeslass contains an actual .-rational divisor. When?. has points everywhere locally, the local to global principle of the Brauer group gives the existence of such a divisor. In this situation, we give an alternative, more down to earth, approach, which indicates how to compute this divisor in certain s作者: 多節(jié) 時(shí)間: 2025-3-29 19:12
Conjectures about Discriminants of Hecke Algebras of Prime Level of weight bigger than?2, we are are led to make a precise conjecture about indexes of Hecke algebras in their normalisation which implies (if true) the surprising conjecture that there are no mod?. congruences between non-conjugate newforms in ..(Γ.(.)), but there are almost always many such congru作者: Incorporate 時(shí)間: 2025-3-29 19:42 作者: wall-stress 時(shí)間: 2025-3-30 02:03 作者: 旅行路線 時(shí)間: 2025-3-30 04:40 作者: GRIPE 時(shí)間: 2025-3-30 10:41
Proving the Primality of Very Large Numbers with fastECPPion, fastECPP, runs in heuristic time .. The aim of this article is to describe new ideas used when dealing with very large numbers. We illustrate these with the primality proofs of some numbers with more than 10,000 decimal digits.作者: enhance 時(shí)間: 2025-3-30 13:25
A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii’s Algorithmgorithm computes the group order of the Jacobian of a genus 2 curve over a finite field for which the characteristic polynomial of the Frobenius endomorphism is known modulo some integer. The main tool is a 2-dimensional pseudo-random walk that allows to heuristically choose random elements in a 2-d作者: COMMA 時(shí)間: 2025-3-30 18:49 作者: 嚴(yán)厲譴責(zé) 時(shí)間: 2025-3-30 21:59 作者: 輪流 時(shí)間: 2025-3-31 01:51 作者: 脫離 時(shí)間: 2025-3-31 05:30 作者: 宣傳 時(shí)間: 2025-3-31 09:28 作者: 欺騙世家 時(shí)間: 2025-3-31 14:16 作者: 季雨 時(shí)間: 2025-3-31 17:45 作者: 引水渠 時(shí)間: 2025-3-31 22:02 作者: 易達(dá)到 時(shí)間: 2025-4-1 04:24 作者: 不透明 時(shí)間: 2025-4-1 07:33
https://doi.org/10.1007/978-3-662-06514-3the difference in performance is much smaller than what one might infer from the original description. Also, thanks to CEILIDH’s simple group law, it provides a greater flexibility for applications, and may thus be considered a worthwhile alternative to XTR.
