忍耐 发表于 2025-3-23 10:57:30

http://reply.papertrans.cn/16/1531/153004/153004_11.png

myopia 发表于 2025-3-23 16:45:19

https://doi.org/10.1007/978-3-662-06513-6lattice reduction — for finding the small roots of multivariate polynomials modulo an integer. For our needs, we improve the lattice construction step of Coppersmith’s method: we describe a way to find a subset of a set of vectors that decreases the Minkowski theorem bound, in a rather general setup including Coppersmith-type lattices.

Bmd955 发表于 2025-3-23 19:29:48

http://reply.papertrans.cn/16/1531/153004/153004_13.png

梯田 发表于 2025-3-23 22:33:38

http://reply.papertrans.cn/16/1531/153004/153004_14.png

Dungeon 发表于 2025-3-24 03:41:50

On the Computation of the Coefficients of a Modular Formion of the .. torsion points of which the representation consists is found via a height estimate, obtained from Arakelov theory, combined with numerical approximation. The height estimate implies that the required precision for the approximation grows at most polynomially in ..

ANN 发表于 2025-3-24 09:02:59

LLL on the Averager to give a clearer picture of the differences/similarities between the average and worst cases. Our work is intended to clarify the practical behavior of L. and to raise theoretical questions on its average behavior.

壕沟 发表于 2025-3-24 14:29:31

http://reply.papertrans.cn/16/1531/153004/153004_17.png

maverick 发表于 2025-3-24 15:16:24

http://reply.papertrans.cn/16/1531/153004/153004_18.png

peak-flow 发表于 2025-3-24 19:08:27

http://reply.papertrans.cn/16/1531/153004/153004_19.png

NOCT 发表于 2025-3-25 02:16:37

http://reply.papertrans.cn/16/1531/153004/153004_20.png
页: 1 [2] 3 4 5 6 7
查看完整版本: Titlebook: Algorithmic Number Theory; 7th International Sy Florian Hess,Sebastian Pauli,Michael Pohst Conference proceedings 2006 Springer-Verlag Berl