1 / 15

計算數論

計算數論. 交通大學 資訊工程系 陳榮傑. Outline. 1. Abelian groups 2. Rings 3. Algebraic numbers 4. Number fields 5. Finite fields 6. Algorithms for finite fields 7. Primality testing 8. Factoring 9. Discrete logarithm. Grading. Homeworks 20% Midterm 35% Final 45%. Reference.

maestas
Télécharger la présentation

計算數論

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 計算數論 交通大學 資訊工程系 陳榮傑

  2. Outline 1. Abelian groups2. Rings3. Algebraic numbers4. Number fields5. Finite fields6. Algorithms for finite fields7. Primality testing8. Factoring9. Discrete logarithm

  3. Grading Homeworks 20%Midterm 35%Final 45%

  4. Reference A computational introduction to number theory and algebra (2nd edition) by Victor Shoup

  5. Grobner bases approach for polynomial systems

  6. Cantor-Zassenhaus Algorithm – factoring polynomials

More Related