• DocumentCode
    3390025
  • Title

    Finding points on curves over finite fields

  • Author

    von zur Gathen, Joachim ; Shparlinski, Igor

  • Author_Institution
    FB Math.-Inf., Paderborn Univ., Germany
  • fYear
    1995
  • fDate
    23-25 Oct 1995
  • Firstpage
    284
  • Lastpage
    292
  • Abstract
    We solve two computational problems concerning plane algebraic curves over finite fields: generating an (approximately) uniform random point, and finding all points deterministically in amortized polynomial time (over a prime field, for non-exceptional curves)
  • Keywords
    computational geometry; amortized polynomial time; computational problems; curves; finite fields; plane algebraic curves; uniform random point; Approximation algorithms; Australia; Elliptic curves; Galois fields; Polynomials; Power generation; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium on
  • Conference_Location
    Milwaukee, WI
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-7183-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1995.492484
  • Filename
    492484
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3390025