• DocumentCode
    1478990
  • Title

    Note on taking square-roots modulo N

  • Author

    Bach, Eric ; Huber, Klaus

  • Author_Institution
    Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
  • Volume
    45
  • Issue
    2
  • fYear
    1999
  • fDate
    3/1/1999 12:00:00 AM
  • Firstpage
    807
  • Lastpage
    809
  • Abstract
    In this article it is shown how Gauss´ (1981) famous cyclotomic sum formula can be used for extracting square-roots modulo N
  • Keywords
    cryptography; digital arithmetic; Gauss cyclotomic sum formula; cryptography; square-roots modulo N; Cryptography; Equations; Gaussian processes; Jacobian matrices; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.749034
  • Filename
    749034
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1478990