標題: Titlebook: Algorithmic Number Theory; 4th International Sy Wieb Bosma Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithmic N [打印本頁] 作者: formation 時間: 2025-3-21 18: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é)科排名
作者: 支架 時間: 2025-3-21 22:43
https://doi.org/10.1007/978-3-8349-6924-8using such quotients of modular jacobians is that fast methods are known for finding their number of points over finite fields [6]. Our results extend ideas of M. Shimura [13] who used only the full modular jacobian instead of abelian quotients of it.作者: Lumbar-Stenosis 時間: 2025-3-22 01:10
Das Leistungs- und Produktportfoliois for . = 4,5, thus proving that .. + .. = .. and .. + .. = .. have only trivial primitive solutions. In the process we meet a Jacobian of a curve that has more 6-torsion at any prime of good reduction than it has globally. Furthermore, some pointers are given to computational aids for applying Chabauty methods.作者: CAND 時間: 2025-3-22 05:20 作者: 上漲 時間: 2025-3-22 12:00 作者: occurrence 時間: 2025-3-22 16:30
Gesch?ftsmodell/Unternehmenskonzeptlog.).. Our approach is also useful in reducing the amount of randomness needed to factor a polynomial completely in expected polynomial time. We present a random polynomial time algorithm for factoring polynomials over finite fields which requires only log . random bits. All these results assume the Extended Riemann Hypothesis.作者: escalate 時間: 2025-3-22 20:00 作者: 催眠藥 時間: 2025-3-22 22:05 作者: FLAT 時間: 2025-3-23 01:56 作者: endocardium 時間: 2025-3-23 06:34
Lattice Reduction in Cryptology: An Updateuter science, especially in algorithmic number theory and cryptology. In this paper, we survey some applications of lattices to cryptology. We focus on recent developments of lattice reduction both in cryptography and cryptanalysis, which followed seminal works of Ajtai and Coppersmith.作者: Infuriate 時間: 2025-3-23 12:27
Construction of Secure , , Curves Using Modular Curvesusing such quotients of modular jacobians is that fast methods are known for finding their number of points over finite fields [6]. Our results extend ideas of M. Shimura [13] who used only the full modular jacobian instead of abelian quotients of it.作者: cauda-equina 時間: 2025-3-23 15:37
On Powers as Sums of Two Cubesis for . = 4,5, thus proving that .. + .. = .. and .. + .. = .. have only trivial primitive solutions. In the process we meet a Jacobian of a curve that has more 6-torsion at any prime of good reduction than it has globally. Furthermore, some pointers are given to computational aids for applying Chabauty methods.作者: excursion 時間: 2025-3-23 20:00 作者: Leaven 時間: 2025-3-24 00:44 作者: Pigeon 時間: 2025-3-24 06:03 作者: CANON 時間: 2025-3-24 07:15
https://doi.org/10.1007/978-3-322-89382-6hese are combined with a birthday paradox algorithm to calculate the cardinality. Our methods are practical and we give actual results computed using our current implementation. The Jacobian groups we handle are larger than those previously reported in the literature.作者: majestic 時間: 2025-3-24 11:08 作者: 充滿裝飾 時間: 2025-3-24 15:06 作者: 忘川河 時間: 2025-3-24 22:58
On Reconstruction of Algebraic Numbers roots of algebraic numbers. Secondly, we get an algorithm to factor polynomials over number fields which generalizes the Hensel-factoring method. Our method uses only integral LLL-reductions in contrast to the real LLL-reductions suggested by [6,8].作者: padding 時間: 2025-3-25 01:39 作者: 描述 時間: 2025-3-25 06:04 作者: 較早 時間: 2025-3-25 09:21 作者: 的闡明 時間: 2025-3-25 13:32 作者: APO 時間: 2025-3-25 19:19 作者: tariff 時間: 2025-3-25 20:55 作者: photophobia 時間: 2025-3-26 02:04
Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensionsegrees of these extensions, which turns out to be the main difficulty. While in two special situations explicit formulas for the degrees are known, the general problem is solved algorithmically. The systematic application of the methods described yields several new examples of algebraic curves over 作者: Rct393 時間: 2025-3-26 05:14 作者: FACET 時間: 2025-3-26 09:45
Baby-Step Giant-Step Algorithms for Non-uniform Distributionsalisation of this algorithm, where extra baby steps may be computed after carrying out giant steps (thus increasing the giant step size). The paper considers the problem of deciding how many, and when, extra baby steps should be computed so that the expected cost of the generalised algorithm is mini作者: 以煙熏消毒 時間: 2025-3-26 13:02 作者: ARK 時間: 2025-3-26 17:42
Strategies in Filtering in the Number Field Sieve using a Block Lanczos algorithm. Both size and weight (the number of non-zero elements) of the matrix critically affect the running time of Block Lanczos. In order to keep size and weight small the relations coming out of the siever do not flow directly into the matrix, but are filtered first in or作者: 蛤肉 時間: 2025-3-27 00:29 作者: hedonic 時間: 2025-3-27 03:02
Computing Special Values of Partial Zeta Functionscle for ..(?); the special values are computed as periods of Ψ, and are expressed in terms of generalized Dedekind sums. We conclude with some numerical examples for cubic and quartic fields of small discriminant.作者: Atheroma 時間: 2025-3-27 06:36
On Reconstruction of Algebraic Numbers a number . if it exists such that . is smaller then the given bound and . ≡. mod ...The first application is an algorithm for the computation of .-th roots of algebraic numbers. Secondly, we get an algorithm to factor polynomials over number fields which generalizes the Hensel-factoring method. Our作者: 枕墊 時間: 2025-3-27 13:02 作者: 心痛 時間: 2025-3-27 14:28 作者: 逃避責(zé)任 時間: 2025-3-27 20:14
https://doi.org/10.1007/10722028Algorithmic Number Theory; Computational Number Theory; Elliptic Curve Computations; Factoring; Finite F作者: reptile 時間: 2025-3-28 00:17 作者: Lice692 時間: 2025-3-28 04:48 作者: NATTY 時間: 2025-3-28 09:37
Curves over Finite Fields with Many Rational Points Obtained by Ray Class Field Extensionsegrees of these extensions, which turns out to be the main difficulty. While in two special situations explicit formulas for the degrees are known, the general problem is solved algorithmically. The systematic application of the methods described yields several new examples of algebraic curves over . and . with comparatively many rational points.作者: Cultivate 時間: 2025-3-28 11:40
New Results on Lattice Basis Reduction in Practice lattice basis in practice. We analyze substantial experimental data and to our knowledge, we are the first to present a general heuristic for determining which variant of the reduction algorithm, for varied parameter choices, yields the most efficient reduction strategy for reducing a particular problem instance.作者: impale 時間: 2025-3-28 18:03
Computing Special Values of Partial Zeta Functionscle for ..(?); the special values are computed as periods of Ψ, and are expressed in terms of generalized Dedekind sums. We conclude with some numerical examples for cubic and quartic fields of small discriminant.作者: epinephrine 時間: 2025-3-28 19:11 作者: 認為 時間: 2025-3-28 23:49
Management, Personal und OrganisationWe give an efficient algorithm for factoring polynomials over finite algebraic extensions of the .-adic numbers. This algorithm uses ideas of Chistov’s random polynomial-time algorithm, and is suitable for practical implementation.作者: Headstrong 時間: 2025-3-29 05:40 作者: Acupressure 時間: 2025-3-29 10:42 作者: Jubilation 時間: 2025-3-29 12:50 作者: 流眼淚 時間: 2025-3-29 18:06
Factoring Polynomials over ,-Adic FieldsWe give an efficient algorithm for factoring polynomials over finite algebraic extensions of the .-adic numbers. This algorithm uses ideas of Chistov’s random polynomial-time algorithm, and is suitable for practical implementation.作者: 來自于 時間: 2025-3-29 23:27 作者: Psa617 時間: 2025-3-30 00:26
Counting Discriminants of Number Fields of Degree up to FourFor each permutation group . on . letters with .?≤?4, we give results, conjectures and numerical computations on discriminants of number fields . of degree . over ? such that the Galois group of the Galois closure of . is isomorphic to ..作者: 生氣地 時間: 2025-3-30 04:30 作者: misshapen 時間: 2025-3-30 10:16
Wieb BosmaIncludes supplementary material: 作者: lymphoma 時間: 2025-3-30 16:05 作者: Counteract 時間: 2025-3-30 19:14 作者: 放氣 時間: 2025-3-31 00:27
0302-9743 Overview: Includes supplementary material: 978-3-540-67695-9978-3-540-44994-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ADORN 時間: 2025-3-31 04:06
Management, Personal und Organisationf intractability. We will discuss Ajtai’s worst-case/average-case connections for the shortest vector problem, similar results for the closest vector problem and short basis problem, NP-hardness and non-NP-hardness, transference theorems between primal and dual lattices, and application to secure cryptography.作者: 證實 時間: 2025-3-31 09:00
Management, Personal und Organisationegrees of these extensions, which turns out to be the main difficulty. While in two special situations explicit formulas for the degrees are known, the general problem is solved algorithmically. The systematic application of the methods described yields several new examples of algebraic curves over . and . with comparatively many rational points.作者: exigent 時間: 2025-3-31 12:47
Management, Personal und Organisation lattice basis in practice. We analyze substantial experimental data and to our knowledge, we are the first to present a general heuristic for determining which variant of the reduction algorithm, for varied parameter choices, yields the most efficient reduction strategy for reducing a particular problem instance.作者: 無動于衷 時間: 2025-3-31 16:36
Das Leistungs- und Produktportfoliocle for ..(?); the special values are computed as periods of Ψ, and are expressed in terms of generalized Dedekind sums. We conclude with some numerical examples for cubic and quartic fields of small discriminant.作者: 賄賂 時間: 2025-3-31 20:58
Das Umsatzvolumen im Optionshandel, on numbers of . bits. This algorithm is based on a recent algorithm of Atkin and Bernstein [1], modified using ideas developed by Vorono? for analyzing the Dirichlet divisor problem [20]. We give timing results which show our algorithm has roughly the expected running time.作者: Indent 時間: 2025-3-31 23:12 作者: 肥料 時間: 2025-4-1 04:34 作者: 等待 時間: 2025-4-1 07:18
