• DocumentCode
    2907380
  • Title

    Fast Algorithm for Computing the Minimal Polynomials of Gaussian Periods

  • Author

    Debiao, He ; Jianhua, Chen ; Zhjin, Hu

  • Author_Institution
    Sch. of Math. & Stat., Whan Univ., Wuhan, China
  • Volume
    1
  • fYear
    2009
  • fDate
    12-14 Dec. 2009
  • Firstpage
    166
  • Lastpage
    169
  • Abstract
    Gaussian Periods, the basis of the theory of compass and straightedge construction, introduced by Gauss, play an important role in the history of mathematics. An efficient way of computing minimal polynomials of Gaussian Periods is proposed. Compared with other methods, the method which is much simpler and much easier to be implemented can avoid approximate computation because its progress is completed in rational integer ring.
  • Keywords
    number theory; polynomial approximation; Gaussian periods; compass theory; minimal polynomial computing; rational integer ring; straightedge construction theory; Algebra; Algorithm design and analysis; Computational intelligence; Cryptography; Gaussian processes; Helium; History; Mathematics; Polynomials; Statistics; Gaussian Periods; Irreducible Polynomia; Minimal Polynomial; Primitive Roots; normal basis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Design, 2009. ISCID '09. Second International Symposium on
  • Conference_Location
    Changsha
  • Print_ISBN
    978-0-7695-3865-5
  • Type

    conf

  • DOI
    10.1109/ISCID.2009.49
  • Filename
    5368860