Algorithmic number theory : lattices, number fields, curves and cryptography
著者
書誌事項
Algorithmic number theory : lattices, number fields, curves and cryptography
(Mathematical Sciences Research Institute publications, 44)
Cambridge University Press, 2008
大学図書館所蔵 全38件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
内容説明・目次
内容説明
Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.
目次
- 1. Solving Pell's equation Hendrik Lenstra
- 2. Basic algorithms in number theory Joe Buhler and Stan Wagon
- 3. Elliptic curves Bjorn Poonen
- 4. The arithmetic of number rings Peter Stevenhagen
- 5. Fast multiplication and applications Dan Bernstein
- 6. Primality testing Rene Schoof
- 7. Smooth numbers: computational number theory and beyond Andrew Granville
- 8. Smooth numbers and the quadratic sieve Carl Pomerance
- 9. The number field sieve Peter Stevenhagen
- 10. Elementary thoughts on discrete logarithms Carl Pomerance
- 11. The impact of the number field sieve on the discrete logarithm problem in finite fields Oliver Schirokauer
- 12. Lattices Hendrik Lenstra
- 13. Reducing lattices to find small-height values of univariate polynomials Dan Bernstein
- 14. Protecting communications against forgery Dan Bernstein
- 15. Computing Arakelov class groups Rene Schoof
- 16. Computational class field theory Henri Cohen and Peter Stevenhagen
- 17. Zeta functions over finite fields Daqing Wan
- 18. Counting points on varieties over finite fields Alan Lauder and Daqing Wan
- 19. How to get your hands on modular forms using modular symbols William Stein
- 20. Congruent number problems in dimension one and two Jaap Top and Noriko Yui.
「Nielsen BookData」 より