找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Algorithmic Number Theory; 4th International Sy Wieb Bosma Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithmic N

[復(fù)制鏈接]
查看: 24849|回復(fù): 61
樓主
發(fā)表于 2025-3-21 18:01:53 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
期刊全稱Algorithmic Number Theory
期刊簡(jiǎn)稱4th International Sy
影響因子2023Wieb Bosma
視頻videohttp://file.papertrans.cn/154/153001/153001.mp4
發(fā)行地址Includes supplementary material:
學(xué)科分類Lecture Notes in Computer Science
圖書封面Titlebook: Algorithmic Number Theory; 4th International Sy Wieb Bosma Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Algorithmic N
Pindex Conference proceedings 2000
The information of publication is updating

書目名稱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é)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:43:57 | 只看該作者
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.
板凳
發(fā)表于 2025-3-22 01:10:09 | 只看該作者
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.
地板
發(fā)表于 2025-3-22 05:20:33 | 只看該作者
5#
發(fā)表于 2025-3-22 12:00:37 | 只看該作者
6#
發(fā)表于 2025-3-22 16:30:55 | 只看該作者
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.
7#
發(fā)表于 2025-3-22 20:00:58 | 只看該作者
8#
發(fā)表于 2025-3-22 22:05:43 | 只看該作者
9#
發(fā)表于 2025-3-23 01:56:06 | 只看該作者
10#
發(fā)表于 2025-3-23 06:34:07 | 只看該作者
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.
 關(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, 2026-1-18 19:29
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
徐汇区| 肇东市| 德格县| 白朗县| 克东县| 克山县| 长丰县| 浏阳市| 韩城市| 思茅市| 金坛市| 共和县| 丹凤县| 唐海县| 彰武县| SHOW| 顺义区| 霍邱县| 额敏县| 阿克陶县| 华宁县| 濮阳县| 阿鲁科尔沁旗| 奉新县| 芜湖县| 扶风县| 婺源县| 治多县| 富宁县| 平阴县| 光山县| 丰宁| 湘乡市| 台中市| 密云县| 扶余县| 葵青区| 宜昌市| 墨江| 新营市| 渭南市|