• DocumentCode
    1346256
  • Title

    p-adic number theory

  • Author

    Naguib, G.

  • Author_Institution
    Dept. of Electr. & Electron. Eng. Newcastle upon Tyne Univ.
  • Volume
    135
  • Issue
    3
  • fYear
    1988
  • fDate
    6/1/1988 12:00:00 AM
  • Firstpage
    107
  • Lastpage
    115
  • Abstract
    p-adic systems, although introduced by Hensel in 1908, have only recently attracted attention for their possible uses in exact linear computations, matrix processors, signal transformations and cryptography. The paper gives a detailed analysis of the subject of p-adic number theory. An examination of both the infinite and finite p-adic number systems is presented. For infinite systems, a practical efficient algorithm is developed for the computation of the p-adic period for any rational number, given the prime p. In finite systems, on the other hand, the author demonstrates that the original algorithms developed by Krishnamurthy (1975, 1977) for the four main arithmetic operations are erroneous and presents new algorithms which circumvent these drawbacks
  • Keywords
    mathematics computing; matrix algebra; number theory; cryptography; exact linear computations; finite p-adic number systems; four main arithmetic operations; infinite p-adic number systems; matrix processors; p-adic number theory; p-adic systems; signal transformations;
  • fLanguage
    English
  • Journal_Title
    Electronic Circuits and Systems, IEE Proceedings G
  • Publisher
    iet
  • ISSN
    0143-7089
  • Type

    jour

  • Filename
    6634