標(biāo)題: Titlebook: Algorithmic Number Theory; First International Leonard M. Adleman,Ming-Deh Huang Conference proceedings 1994 Springer-Verlag Berlin Heidel [打印本頁] 作者: Consonant 時(shí)間: 2025-3-21 20:01
書目名稱Algorithmic Number Theory影響因子(影響力)
書目名稱Algorithmic Number Theory影響因子(影響力)學(xué)科排名
書目名稱Algorithmic Number Theory網(wǎng)絡(luò)公開度
書目名稱Algorithmic Number Theory網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithmic Number Theory被引頻次
書目名稱Algorithmic Number Theory被引頻次學(xué)科排名
書目名稱Algorithmic Number Theory年度引用
書目名稱Algorithmic Number Theory年度引用學(xué)科排名
書目名稱Algorithmic Number Theory讀者反饋
書目名稱Algorithmic Number Theory讀者反饋學(xué)科排名
作者: 流利圓滑 時(shí)間: 2025-3-21 21:29 作者: 金絲雀 時(shí)間: 2025-3-22 00:40 作者: 拒絕 時(shí)間: 2025-3-22 07:22
Das Leistungs- und Produktportfoliohe base .. It is widely conjectured, but not proved, that . > 3 for infinitely many .. We show the stronger result that . > (log .). for infinitely many .. We also show that there are finite sets of odd composites which do not have a ., namely a common witness for all of the numbers in the set.作者: GIBE 時(shí)間: 2025-3-22 11:48
Gesch?ftsmodell/Unternehmenskonzeptgorithm. Our experiments indicate that we have achieved a substantial speed-up compared to other implementations that are reported in the literature. The main improvements are a new lattice sieving technique and a trial division method that is based on lattice sieving in a hash table. This also allo作者: VERT 時(shí)間: 2025-3-22 15:42
https://doi.org/10.1007/978-3-8349-9232-1s do not appear to be easily adaptable for finding discrete logarithms in the groups associated with elliptic curves and the Jacobians of hyperelliptic curves. This has led to the development of cryptographic systems based on the discrete logarithm problem for such groups [12, 7, 8]. In this paper a作者: CORD 時(shí)間: 2025-3-22 18:36 作者: Heart-Attack 時(shí)間: 2025-3-23 00:06 作者: cardiac-arrest 時(shí)間: 2025-3-23 02:31 作者: Firefly 時(shí)間: 2025-3-23 08:39 作者: fabricate 時(shí)間: 2025-3-23 11:33
Management Personal und Organisation in the “congruent number” problem. We begin by briefly reviewing the cyclotomic construction of units in real quadratic number fields, which is analogous in many ways to the Heegner-point approach to the arithmetic of elliptic curves, and allows us to introduce some of the key ideas in a more famil作者: 臭了生氣 時(shí)間: 2025-3-23 16:09
Das Leistungs- und ProduktportfolioΓ.(.) of the modular group Γ = .(2, ?). Equivalently, there is a non-constant map ? from the modular curve ... to .. We present here a method of computing the degree of such a map ? for arbitrary .. Our method, which works for all subgroups of finite index in Γ and not just Γ.(.), is derived from a 作者: 不足的東西 時(shí)間: 2025-3-23 20:41
Das Leistungs- und Produktportfoliowhen applied to random inputs, the complexity is asymptotically constant, the probability distribution decays geometrically, and the dynamics is characterized by a conditional invariant measure. The proofs make use of connections between lattice reduction, continued fractions, continuants, and funct作者: 要塞 時(shí)間: 2025-3-23 22:56 作者: xanthelasma 時(shí)間: 2025-3-24 02:25
Management, Personal und OrganisationWe report on algorithmic aspects of the problem of explicitly computing the rate of growth of the field of ..-th division points on an .-dimensional simple Abelian variety with Complex Multiplication. Two new examples are discussed.作者: irritation 時(shí)間: 2025-3-24 07:33 作者: PON 時(shí)間: 2025-3-24 11:30
Leistungs- und ProduktportfolioWe show that if polynomials with many rational roots have polynomial length straight-line complexity, then integer factorization is “easy”.作者: overhaul 時(shí)間: 2025-3-24 15:32 作者: GAVEL 時(shí)間: 2025-3-24 20:53
Counting the number of points on elliptic curves over finite fields of characteristic greater than We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a finite field. We describe an implementation of this algorithm for prime fields. We report on the use of this implementation to count the number of points on a curve over .., where . is a 375-digit prime.作者: Handedness 時(shí)間: 2025-3-25 00:00
Straight-line complexity and integer factorization,We show that if polynomials with many rational roots have polynomial length straight-line complexity, then integer factorization is “easy”.作者: Chemotherapy 時(shí)間: 2025-3-25 05:18
https://doi.org/10.1007/3-540-58691-1Finite Fields; Greatest Common Divisor (GCD); Gr??tter Gemeinsamer Teiler; Integer Factorization; Number作者: CHASE 時(shí)間: 2025-3-25 08:23 作者: 讓空氣進(jìn)入 時(shí)間: 2025-3-25 13:21 作者: BIDE 時(shí)間: 2025-3-25 16:55
,Schoof’s algorithm and isogeny cycles,. Elkies and Atkin have designed practical improvements to the basic algorithm, that make use of “good” primes .. We show how to use powers of good primes in an efficient way. This is done by computing isogenies between curves over the ground field. A new structure appears, called “isogeny cycle”. We investigate some properties of this structure.作者: BILL 時(shí)間: 2025-3-25 21:19 作者: Corporeal 時(shí)間: 2025-3-26 00:21
Algorithmic Number Theory978-3-540-49044-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Anhydrous 時(shí)間: 2025-3-26 04:34 作者: Rotator-Cuff 時(shí)間: 2025-3-26 09:05 作者: ARENA 時(shí)間: 2025-3-26 15:26 作者: Obedient 時(shí)間: 2025-3-26 17:05
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152997.jpg作者: Heart-Rate 時(shí)間: 2025-3-26 22:50 作者: 隼鷹 時(shí)間: 2025-3-27 01:43
Lattice sieving and trial division,gorithm. Our experiments indicate that we have achieved a substantial speed-up compared to other implementations that are reported in the literature. The main improvements are a new lattice sieving technique and a trial division method that is based on lattice sieving in a hash table. This also allo作者: 遠(yuǎn)地點(diǎn) 時(shí)間: 2025-3-27 06:12
A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of ls do not appear to be easily adaptable for finding discrete logarithms in the groups associated with elliptic curves and the Jacobians of hyperelliptic curves. This has led to the development of cryptographic systems based on the discrete logarithm problem for such groups [12, 7, 8]. In this paper a作者: fringe 時(shí)間: 2025-3-27 11:53 作者: 輕率看法 時(shí)間: 2025-3-27 15:35 作者: beta-carotene 時(shí)間: 2025-3-27 19:07
A new modular interpolation algorithm for factoring multivariate polynomials,ariate factorizations. Whereas other interpolation algorithms for polynomial factorization depend on various extensions of the Hilbert irreducibility theorem, our approach is the first to depend only upon the classical formulation. The key to our technique is the interpolation scheme for multivalued作者: ARM 時(shí)間: 2025-3-27 22:53 作者: 懸掛 時(shí)間: 2025-3-28 05:40
Heegner point computations, in the “congruent number” problem. We begin by briefly reviewing the cyclotomic construction of units in real quadratic number fields, which is analogous in many ways to the Heegner-point approach to the arithmetic of elliptic curves, and allows us to introduce some of the key ideas in a more famil作者: 里程碑 時(shí)間: 2025-3-28 10:01 作者: 工作 時(shí)間: 2025-3-28 12:31
An analysis of the Gaussian algorithm for lattice reduction,when applied to random inputs, the complexity is asymptotically constant, the probability distribution decays geometrically, and the dynamics is characterized by a conditional invariant measure. The proofs make use of connections between lattice reduction, continued fractions, continuants, and funct作者: ostensible 時(shí)間: 2025-3-28 18:29 作者: exclusice 時(shí)間: 2025-3-28 22:50
0302-9743 NY in May 1994..The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational 作者: 生命層 時(shí)間: 2025-3-29 01:17 作者: Postmenopause 時(shí)間: 2025-3-29 06:38 作者: Haphazard 時(shí)間: 2025-3-29 08:01 作者: 拱墻 時(shí)間: 2025-3-29 14:14
https://doi.org/10.1007/978-3-8349-9232-1.., for all odd primes . with log . ≤ (2. + 1)., the algorithm computes discrete logarithms in the group of rational points on the Jacobian of a genus . hyperelliptic curve over GF(.) within expected time: ..[1/2, .] where . ≤ 2.181.作者: 忍受 時(shí)間: 2025-3-29 19:28 作者: motivate 時(shí)間: 2025-3-29 23:32
Gesch?ftsmodell/Unternehmenskonzeptws us to collect triple and quadruple large prime relations in an efficient manner. Furthermore we show how the computation can efficiently be shared among multiple processors in a high-band-width environment.作者: 傻 時(shí)間: 2025-3-30 03:13
Management, Personal und Organisation black boxes originally developed by Ar et. al. [1]. We feel that this combination of the classical Hilbert irreducibility theorem and multivalued black boxes provides a particularly simple and intuitive approach to polynomial factorization.作者: 圓木可阻礙 時(shí)間: 2025-3-30 04:52
Management Personal und Organisationiar setting. We then quote the key results and conjectures that we shall need concerning elliptic curves and Heegner points, and show how they yield practical algorithms for finding rational points on .. and other properties of such curves. We conclude with a report on more recent work along similar lines on the elliptic curves .. + .. = ..作者: Brain-Imaging 時(shí)間: 2025-3-30 09:34
Das Leistungs- und Produktportfoliomethod of Zagier in [2]; by using those ideas, together with techniques which have been used by the author to compute large tables of modular elliptic curves (see [1]), we are able to derive an explicit and general formula which is simpler to implement than Zagier‘s. We discuss the results obtained, including several examples.作者: expound 時(shí)間: 2025-3-30 15:45 作者: 奴才 時(shí)間: 2025-3-30 18:42 作者: Enrage 時(shí)間: 2025-3-31 00:38
Decomposition of algebraic functions,d in fact can be reformulated as a problem of .. We characterize all decompositions of a given algebraic function up to isomorphism, and give an exponential time algorithm for finding a nontrivial one if it exists. The algorithm involves genus calculations and constructing transcendental generators of fields of genus zero.作者: 表示向下 時(shí)間: 2025-3-31 02:29 作者: 不確定 時(shí)間: 2025-3-31 06:49 作者: 遺棄 時(shí)間: 2025-3-31 09:26 作者: Infirm 時(shí)間: 2025-3-31 16:59
Heegner point computations,iar setting. We then quote the key results and conjectures that we shall need concerning elliptic curves and Heegner points, and show how they yield practical algorithms for finding rational points on .. and other properties of such curves. We conclude with a report on more recent work along similar lines on the elliptic curves .. + .. = ..作者: corporate 時(shí)間: 2025-3-31 20:06
Computing the degree of a modular parametrization,method of Zagier in [2]; by using those ideas, together with techniques which have been used by the author to compute large tables of modular elliptic curves (see [1]), we are able to derive an explicit and general formula which is simpler to implement than Zagier‘s. We discuss the results obtained, including several examples.作者: 冥想后 時(shí)間: 2025-3-31 22:20 作者: Coronary-Spasm 時(shí)間: 2025-4-1 02:35
