Heart-Rate
发表于 2025-3-26 22:50:43
http://reply.papertrans.cn/16/1530/152997/152997_31.png
隼鹰
发表于 2025-3-27 01:43:44
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
远地点
发表于 2025-3-27 06:12:25
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 . In this paper a
fringe
发表于 2025-3-27 11:53:23
http://reply.papertrans.cn/16/1530/152997/152997_34.png
轻率看法
发表于 2025-3-27 15:35:23
http://reply.papertrans.cn/16/1530/152997/152997_35.png
beta-carotene
发表于 2025-3-27 19:07:52
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
发表于 2025-3-27 22:53:19
http://reply.papertrans.cn/16/1530/152997/152997_37.png
悬挂
发表于 2025-3-28 05:40:24
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
里程碑
发表于 2025-3-28 10:01:58
http://reply.papertrans.cn/16/1530/152997/152997_39.png
工作
发表于 2025-3-28 12:31:50
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