• DocumentCode
    1446703
  • Title

    Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity

  • Author

    Akleylek, Sedat ; Özbudak, Ferruh

  • Author_Institution
    Dept. of Comput. Eng., Ondokuz Mayis Univ., Samsun, Turkey
  • Volume
    61
  • Issue
    3
  • fYear
    2012
  • fDate
    3/1/2012 12:00:00 AM
  • Firstpage
    427
  • Lastpage
    432
  • Abstract
    We give a modified redundant representation for designing arithmetic circuits with small complexity. Using our modified redundant representation, we improve many of the complexity values significantly. Our method works for any finite field. We also give some applications in cryptography.
  • Keywords
    Galois fields; circuit complexity; cryptography; digital arithmetic; logic design; redundancy; arithmetic circuit design; circuit complexity; cryptography; finite field; modified redundant representation; Circuit synthesis; Complexity theory; Cryptography; Educational institutions; Logic gates; Polynomials; Galois field arithmetic; VLSI implementation.; elliptic curve cryptography; redundant representation;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2011.29
  • Filename
    5710879
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1446703