找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Algorithmic Number Theory; First International Leonard M. Adleman,Ming-Deh Huang Conference proceedings 1994 Springer-Verlag Berlin Heidel

[復(fù)制鏈接]
樓主: Consonant
31#
發(fā)表于 2025-3-26 22:50:43 | 只看該作者
32#
發(fā)表于 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
33#
發(fā)表于 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 [12, 7, 8]. In this paper a
34#
發(fā)表于 2025-3-27 11:53:23 | 只看該作者
35#
發(fā)表于 2025-3-27 15:35:23 | 只看該作者
36#
發(fā)表于 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
37#
發(fā)表于 2025-3-27 22:53:19 | 只看該作者
38#
發(fā)表于 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
39#
發(fā)表于 2025-3-28 10:01:58 | 只看該作者
40#
發(fā)表于 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
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-23 07:03
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
洛隆县| 靖宇县| 清苑县| 沙田区| 确山县| 铜山县| 苏尼特右旗| 珲春市| 茂名市| 大英县| 兴仁县| 郧西县| 昆山市| 桃园县| 万源市| 公安县| 杭锦旗| 西宁市| 石城县| 新晃| 灵宝市| 佛学| 鹿邑县| 富平县| 遂川县| 淮阳县| 芷江| 海城市| 竹溪县| 赤壁市| 阿合奇县| 宣城市| 焦作市| 都兰县| 滦平县| 敦化市| 榆社县| 汪清县| 富平县| 台南县| 灵武市|