| 書(shū)目名稱 | Prime Numbers and Computer Methods for Factorization |
| 編輯 | Hans Riesel |
| 視頻video | http://file.papertrans.cn/756/755253/755253.mp4 |
| 概述 | Includes supplementary material: |
| 叢書(shū)名稱 | Progress in Mathematics |
| 圖書(shū)封面 |  |
| 描述 | .In the modern age of almost universal computer usage, practically every individual in a technologically developed society has routine access to the most up-to-date cryptographic technology that exists, the so-called RSA public-key cryptosystem. A major component of this system is the factorization of large numbers into their primes. Thus an ancient number-theory concept now plays a crucial role in communication among millions of people who may have little or no knowledge of even elementary mathematics...Hans Riesel’s highly successful first edition of this book has now been enlarged and updated with the goal of satisfying the needs of researchers, students, practitioners of cryptography, and non-scientific readers with a mathematical inclination. It includes important advances in computational prime number theory and in factorization as well as re-computed and enlarged tables, accompanied by new tables reflecting current research by both the author and his coworkers and by independent researchers...The book treats four fundamental problems: the number of primes below a given limit, the approximate number of primes, the recognition of primes and the factorization of large numbers. |
| 出版日期 | Book 1994Latest edition |
| 關(guān)鍵詞 | Computer; Factorization; Maxima; Mersenne prime; Prime; Prime Numbers; Prime number; Sage; algorithms; contin |
| 版次 | 2 |
| doi | https://doi.org/10.1007/978-1-4612-0251-6 |
| isbn_softcover | 978-1-4612-6681-5 |
| isbn_ebook | 978-1-4612-0251-6Series ISSN 0743-1643 Series E-ISSN 2296-505X |
| issn_series | 0743-1643 |
| copyright | Springer Science+Business Media New York 1994 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-5 07:38
發(fā)表于 2025-3-21 18:52:46
